You limited your search to:

  Partner: UNT College of Engineering
 Collection: UNT Scholarly Works
Real-Time Systems: An Introduction and the State-of-the-Art

Real-Time Systems: An Introduction and the State-of-the-Art

Date: March 16, 2009
Creator: Kavi, Krishna; Akl, Robert G. & Hurson, Ali
Description: This encyclopedia article gives an overview of the broad area of real-time systems. This task is daunting because real-time systems are everywhere, and yet no generally accepted definition differentiates real-time systems from non-real-time systems. The authors make an attempt at providing a general overview of the different classes of real-time systems, scheduling of tasks (or threads) in such systems, design tools and environments for real-time systems, real-time operating systems, and embedded systems. The authors conclude their discussion with research challenges that still remain.
Contributing Partner: UNT College of Engineering
Grid-based Coordinated Routing in Wireless Sensor Networks

Grid-based Coordinated Routing in Wireless Sensor Networks

Date: January 2007
Creator: Akl, Robert G. & Sawant, Uttara
Description: This paper discusses grid-based coordinated routing in wireless sensor networks. Abstract: This work explores grid-based coordinated routing in wireless sensor networks and compares the energy available in the network over time for different grid sizes. A test area is divided into square-shaped grids of certain length. Fully charged battery powered nodes are randomly placed in the area with fixed source and sink nodes. One node per grid is elected as the coordinator which does the actual routing. The source node starts flooding the network with every coordinator joining in the routing. Once the flooding reaches the sink node, information is sent back to the source by finding the back route to the source. This process is continued until a node (coordinator) along that route runs out of energy. New coordinators are elected to replace the depleted ones. The source node refloods the network so that the sink can find a new back route to send information. This entire process continues until the network is partitioned and the connectivity between the source and the sink nodes is lost. We explore the quality of service of wireless sensor networks, how the coordinator nodes are elected, and the size of the grid area ...
Contributing Partner: UNT College of Engineering
Indoor Propagation Modeling at 2.4 GHZ for IEEE 802.11 Networks

Indoor Propagation Modeling at 2.4 GHZ for IEEE 802.11 Networks

Date: April 2006
Creator: Akl, Robert G.; Tummala, Dinesh & Li, Xinrong
Description: This paper discusses indoor propagation modeling. Abstract: The purpose of this study is to characterize the indoor channel for 802.11 wireless local area networks at 2.4 GHz frequency. This work presents a channel model based on measurements conducted in commonly found scenarios in buildings. These scenarios include closed corridor, open corridor, classroom, and computer lab. Path loss equations are determined using log-distance path loss model and log-normal shadowing. The Chi-square test statistic values for each access point are calculated to prove that the observed fading is a normal distribution at 5% significance level. A numerical analysis of measurements in each scenario was conducted and the study determined equations that describe path loss for each scenario.
Contributing Partner: UNT College of Engineering
Hybrid Approach for Energy-Aware Synchronization

Hybrid Approach for Energy-Aware Synchronization

Date: December 2010
Creator: Akl, Robert G.; Saravanos, Yanos & Haidar, Mohamad
Description: This book chapter discusses a time synchronization scheme for wireless sensor networks that aims to save sensor battery power while maintaining network connectivity for as long as possible. It focuses on aspects of wireless sensor networks. These include designing a hybrid method between reference broadcast synchronization (RBS) and timing-sync protocol for sensor networks (TPSN) to reduce the number of transmissions required to synchronize an entire network, extending single-hop synchronization methods to operate in large multi-hop networks, verifying that the hybrid methods operate as desired by simulating against RBS and TPSN, and maintaining network connectivity and coverage.
Contributing Partner: UNT College of Engineering
Hybrid Energy-Aware Synchronization Algorithm in Wireless Sensor Networks

Hybrid Energy-Aware Synchronization Algorithm in Wireless Sensor Networks

Date: September 2007
Creator: Akl, Robert G. & Saravanos, Yanos
Description: This paper discusses hybrid energy-aware synchronization algorithm in wireless sensor networks. Abstract: We present a time synchronization scheme for wireless sensor networks that aims to conserve sensor battery power while maintaining network connectivity for as long as possible. The proposed method creates a hierarchical tree by flooding the sensor network from a designated source point. It then uses a hybrid algorithm derived from the Timing-sync Protocol for Sensor Networks (TSPN) and the Reference Broadcast Synchronization Method (RBS) to periodically synchronize sensor clocks by minimizing the number of required transmissions. In multi-hop ad-hoc networks, a depleted sensor will drop information from all other sensors that route data through it, decreasing the physical area being monitored by the network. It is therefore imperative that time synchronization schemes are aware of the number of sensors being used at any given time. The proposed method uses several techniques and thresholds to maintain network connectivity. A new source point is chosen when the current one's battery power reaches a designated energy threshold. The network is also re-flooded whenever the number of used sensors drops below another threshold. We implement and show that their scheme can provide significant power savings over both TPSN and RBS; the ...
Contributing Partner: UNT College of Engineering
Global versus Local Call Admission Control in CDMA Cellular Networks

Global versus Local Call Admission Control in CDMA Cellular Networks

Date: July 2004
Creator: Akl, Robert G. & Parvez, Asad
Description: This paper discusses global versus local call admission control. Abstract: We design and implement global and local CAC algorithms for CDMA networks, and compare their network throughput for various mobility scenarios. The global CAC algorithms is inherently optimized and uses global information in making every call admission decision; it yields the best possible performance but has an intensive computational complexity. The design of the local CAC algorithm uses global information but its implementation in each cell uses only local information; it only requires the number of calls currently active in that cell and thus is very simple to implement. We show that our optimized local CAC algorithm achieves almost the same performance as our global CAC algorithm for a given call arrival rate profile.
Contributing Partner: UNT College of Engineering
Impact of Interference Model on Capacity in CDMA Cellular Networks

Impact of Interference Model on Capacity in CDMA Cellular Networks

Date: May 2004
Creator: Akl, Robert G. & Parvez, Asad
Description: This paper discusses an impact of interference model on capacity in CDMA cellular networks. Abstract: An overwhelming number of models in the literature use average interference for calculation of capacity of a CDMA network. In this paper, we calculate the actual per-user interference and analyze the effect of user-distribution on the capacity of a CDMA network. We show that even though the capacity obtained using average interference is a good approximation to the capacity calculated using actual interference for a uniform user distribution, the deviation can be tremendously large for non-uniform user distributions.
Contributing Partner: UNT College of Engineering
Intra-Class Competitive Assignments in CS2: A One-Year Study

Intra-Class Competitive Assignments in CS2: A One-Year Study

Date: July 2006
Creator: Garlick, Ryan & Akl, Robert G.
Description: This paper discusses intra-class competitive assignments in CS2. Abstract: The widespread goals of student retention, introducing larger programming projects, and fostering collaboration among students in computer science courses has led to the inclusion of group projects in many curricula, with task division and collaboration as motivation for students to complete assignments. This paper presents a study in a first-year programming assignment with similar goals, but with methods adopting the contrarian view - having students directly compete with one another in a tournament of their respective software agents. This paper presents the results of a year-long experiment in an intra-class competitive assignment in the second C++ programming course at the University of North Texas in Denton. Metrics of student performance on the assignment, correlation with course grade, student surveys of the project, and retention statistics are presented. Results demonstrating overwhelmingly positive response and high levels of effort among students are submitted, along with remarks on application to student recruiting, retention, and curriculum design.
Contributing Partner: UNT College of Engineering
Multicell CDMA Network Design

Multicell CDMA Network Design

Date: May 2001
Creator: Akl, Robert G.; Hegde, Manju V.; Naraghi-Pour, Mort & Min, Paul S.
Description: Traditional design rules for cellular networks are not directly applicable to code division multiple access (CDMA) networks where intercell interference is not mitigated by cell placement and careful frequency planning. For transmission quality requirements, a minimum signal-to-interface ratio (SIR) must be achieved. The base-station location, its pilot-signal power (which determines the size of the cell), and the transmission power of the mobiles all affect the received SIR. In addition, because of the need for power control in CDMA networks, large cells can cause a lot of interference to adjacent small cells, posing another constraint to design. In order to maximize the network capacity associated with a design, the authors develop a methodology to calculate the sensitivity of capacity to base-station location, pilot-signal power, and transmission power of each mobile. To alleviate the problem caused by difference cell sizes, the authors introduce the power compensation factor, by which the nominal power of the mobiles in every cell is adjusted. The authors then use the calculated sensitivities in an iterative algorithm to determine the optimal locations of the base stations, pilot-signal powers, and power compensation factors in order to maximize capacity. The authors show examples of how networks using these design techniques ...
Contributing Partner: UNT College of Engineering
Corpus-based and Knowledge-based Measures of Text Semantic Similarity

Corpus-based and Knowledge-based Measures of Text Semantic Similarity

Date: July 2006
Creator: Mihalcea, Rada, 1974-; Corley, Courtney & Strapparava, Carlo, 1962-
Description: Abstract: This paper presents a method for measuring the semantic similarity of texts, using corpus-based and knowledge-based measures of similarity. Previous work on this problem has focused mainly on either large documents (e.g. text classification, information retrieval) or individual words (e.g. synonymy tests). Given that a large fraction of the information available today, on the Web and elsewhere, consists of short text snippets (e.g. abstracts of scientific documents, image captions, product descriptions), in this paper the authors focus on measuring the semantic similarity of short texts. Through experiments performed on a paraphrase data set, the authors show that the semantic similarity method out-performs methods based on simple lexical matching, resulting in up to 13% error rate reduction with respect to the traditional vector-based similarity metric.
Contributing Partner: UNT College of Engineering