You limited your search to:
Partner:
UNT College of Engineering
Collection:
UNT Scholarly Works
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
Permallink:digital.library.unt.edu/ark:/67531/metadc30816/
Graph-based Ranking Algorithms for Sentence Extraction, Applied to Text Summarization
Date: July 2004
Creator: Mihalcea, Rada, 1974-
Description: Abstract: This paper presents an innovative unsupervised method for automatic sentence extraction using graph-based ranking algorithms. We evaluate the method in the context of a text summarization task, and show that the results obtained compare favorably with previously published results on established benchmarks.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30957/
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
Permallink:digital.library.unt.edu/ark:/67531/metadc30839/
How to Hide Secrets from Operating System: Architecture Level Support for Dynamic Address Trace Obfuscation
Date: 2004
Creator: Gomathisankaran, Mahadevan & Tyagi, Akhilesh
Description: This technical report addresses how to hide secrets from an operating system. Abstract: The adversary model for digital rights management is much more powerful than for the traditional security scenarios. The adversary has complete control of the computing node - supervisory privileges, physical as well as architectural object observational capabilities. In essence, this makes the operating system (or any other layer around the architecture) itself the adversary. The repercussions of this observation are severe. It creates a need to "keep secrets" from the operating system. We argue for the need to keep secrets from the OS in hardware. This concept is demonstrated through architectural support for the obfuscation of dynamic address traces on the memory bus. The objective is to leak as little information about the executed program sequence as possible. This is done by handing over many of the virtual memory management responsibilities from the operating system to an architecturally isolated hardware black-box (VM black-box). The authors provide a detailed design for the VM blackbox and some microarchitecture level simulation derived performance data. We also describe a compiler directed prefetch scheme that uses both instruction and data prefetches to obfuscate the address traces on the address bus between on-chip ...
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc94282/
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
Permallink:digital.library.unt.edu/ark:/67531/metadc30852/
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
Permallink:digital.library.unt.edu/ark:/67531/metadc30840/
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
Permallink:digital.library.unt.edu/ark:/67531/metadc30817/
Impact of Interference Model on Capacity in CDMA Cellular Networks
Date: July 2004
Creator: Akl, Robert G. & Parvez, Asad
Description: This presentation introduces code division multiple access (CDMA) networks, average and actual interference models, optimized capacity, and the 2D Gaussian user model.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30932/
Improving the search on the Internet by using WordNet and lexical operators
Date: July 21, 1999
Creator: Moldovan, Dan I. & Mihalcea, Rada, 1974-
Description: This article discusses improving the search on the internet by using WordNet and lexical operators. Abstract: This paper presents a natural language interface system to an Internet search engine that provides the following improvements: (1) accepts natural language (English) questions, (2) expands the query, based on a word sense disambiguation method, and (3) uses a new lexical operator to post-process the documents retrieved for extracting only the part of a document that is relevant to a query. The system was tested on 100 queries of which 50 were adopted from the TIPSTER topics collection, provided at the 6th Text Retrieval Conference (TREC-6) and 50 were selected from among the queries submitted by users to an existing Web search engine. The results obtained demonstrate a substantial increase in both the precision and the percentage of queries answered correctly, while the amount of text presented to the user is reduced in comparison with the current Internet search engine technology.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc83306/
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
Permallink:digital.library.unt.edu/ark:/67531/metadc30827/