load situations. For our analysis we consider a particular safety scenario: An emergency vehicle is approaching a traffic jam. In a simulation experiment, we highlight that severe packet loss can occur. The reliable transmission range can be reduced by up to 90%. The main reason for this degradation

as a trade-off between full network connectivity, the reuse of the available spectrum, and power consumption. This paper presents an algorithm to calculate the minimum transmission range of the transceivers that is required to achieve, with some probability, full network connectivity. Furthermore, we

Abstract An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing

An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. Due to the limited transmission range of wireless network interfaces, multiple network "hops &

The transmission range that achieves the most economical use of energy in wireless ad hoc networks is studied under homogeneous node distribution. By assuming the knowledge of node location, we first proposed a transmission strategy to ensure the progress of data packets toward their final

points. The accuracy of localization is then dependent on the separation distance between two adjacent reference points and the transmission range of these reference points. Initial experimental results show that the accuracy for 90% of our data points is within one-third of the separation distance

In the performance evaluation of a protocol for an ad hoc network, the protocol should be tested under realistic conditions including, but not limited to, a sensible transmission range, limited buffer space for the storage of messages, representative data traffic models, and realistic movements

bounds on node density and intracluster and intercluster transmission ranges, HEED can asymptotically almost surely guarantee connectivity of clustered networks. Simulation results demonstrate that our proposed approach is effective in prolonging the network lifetime and supporting scalable data

in a d-dimensional region with a side of lengthl. In this paper the critical transmission range in dense and sparse network is studied. The critical transmission range in RWP mobile network and the critical transmission range for k-connectivity are investigated. The results of this paper could

Multi-hop wireless networks facilitate applications in metropolitan area broadband, home multimedia, surveillance and industrial control networks. Most applications require high end-to-end throughput and/or bounded delay. Current single-hop networks primarily employ random access link-layer protocols such as Carrier Sense Multiple Access (CSMA). These perform poorly in the multi-hop regime and provide no end-to-end QoS guarantees. The primary causes are uncoordinated interference and unfairness in exclusive access of the shared wireless medium. Furthermore, random access schemes do not leverage spatial reuse effectively and require routes to be link-aware. MAX is a time division multiplexed resource allocation framework for multi-hop networks with practical architectures for node scheduling algorithms. MAX tiling delivers optimal end-to-end throughput across arbitrarily large regularly structured networks while maintaining bounded delay. It outperforms CSMA-based random access protocols by a factor of 5-to-8. The MAX approach provides network services including: flexible uplink and downlink bandwidth management, deterministic route admission control, and optimal gateway placement. MAX has being implemented on IEEE 802.15.3 embedded nodes and a test-bed of 50 nodes has been deployed both indoors and outdoors. Keywords: Multi-hop wireless networks, sensor networks, medium access controller, scheduling algorithms, topology I