Abstract not found

An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully, the active nodes must maintain both sensing coverage and network connectivity. Furthermore, the network must be able to configure itself to any feasible degrees of coverage and connectivity in order to support different applications and environments with diverse requirements. This paper presents the design and analysis of novel protocols that can dynamically configure a network to achieve guaranteed degrees of coverage and connectivity. This work differs from existing connectivity or coverage maintenance protocols in several key ways: 1) We present a Coverage Configuration Protocol (CCP) that can provide different degrees of coverage requested by applications. This flexibility allows the network to self-configure for a wide range of applications and (possibly dynamic) environments. 2) We provide a geometric analysis of the relationship between coverage and connectivity. This analysis yields key insights for treating coverage and connectivity in a unified framework: this is in sharp contrast to several existing approaches that address the two problems in isolation. 3) Finally, we integrate CCP with SPAN to provide both coverage and connectivity guarantees. We demonstrate the capability of our protocols to provide guaranteed coverage and connectivity configurations, through both geometric analysis and extensive simulations.

Ad hoc wireless networks are power constrained since nodes operate with limited battery energy. To maximize the lifetime of these networks (defined by the condition that a fixed percentage of the nodes in the network "die out" due to lack of energy), network-related transactions through each mobile node must be controlled such that the power dissipation rates of all nodes are nearly the same. Assuming that all nodes start with a finite amount of battery capacity and that the energy dissipation per bit of data and control packet transmission or reception is known, this paper presents a new source-initiated (on-demand) routing protocol for mobile ad hoc networks that increases the network lifetime. Simulation results show that the proposed power-aware source routing protocol has a higher performance than other source initiated routing protocols in terms of the network lifetime.

On-demand routing protocols for ad hoc networks reduce the cost of routing in high mobility environments. However, route discovery in on-demand routing is typically performed via network-wide flooding, which consumes a substantial amount of bandwidth. Therefore, it is essential to reduce the frequency of route discoveries to achieve efficient communication. In this thesis, we present a technique called by-pass recovery that aims to reduce the frequency of route request oods due to topological changes. Specifically, when a broken link is detected, a node patches the efected route using neighborhood information and thereby by-passes the broken link. We implemented a prototype of our approach based on source routing. Simulation studies show that SLR (Source Routing with Local Recovery) achieves ecient and effective local recovery while maintaining acceptable overhead.

This work seeks a better understanding of the relations between the better network service provided by QoSoriented wireless packet scheduling and the actual benefits perceived by the multimedia applications that use them. Through extensive simulations driven by real (multimedia and wireless channel error) traces, we observe that in general, there is a performance gap between application perceived QoS and network QoS provided by the wireless fair packet scheduler. This gap tends to increase further as the channel error rate aggravates. The exact distribution of channel errors greatly affects the multimedia application performance, but its impact on network QoS is much smaller. We then present the solution, which is based on Idealized Weighted Fair Queuing (IWFQ) to further improve three popular multimedia applications' performance.

Current development in multidisciplinary activities provides real time access to mechtronics systems based on wireless networks. Blimp Project is such an approach in this multidisciplinary area emphasizes the integration of hands-on experience and theoretic thinking in engineering education by college of engineering, a constituent of Rowan University. Blimp Project covers piece of wireless communication. This paper proposes the possible development of Real Time Wireless Sensor Ad-hoc Network for Blimp project to build a computer-controlled unmanned blimp. New network topologies for wireless real-time networks leading to enhanced performance and new applications. The first implementation of the gateway allows the decentralized collection of data, the transmission from the sensor to the gateway via Bluetooth, and the transmission from the gateway to the central server via