On the lifetime of node-to-node communication in wireless ad hoc networks

Authors:
Javad Vazifehdan;R. Venkatesha Prasad;Ignas Niemegeers
Affiliations:
Delft University of Technology, Mekelweg 4, 2628 CD, Delft, The Netherlands;Delft University of Technology, Mekelweg 4, 2628 CD, Delft, The Netherlands;Delft University of Technology, Mekelweg 4, 2628 CD, Delft, The Netherlands
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2012

Citing 21
Cited 1

Network resilience

SIAM Journal on Algebraic and Discrete Methods
Network Resilience: A Measure of Network Fault Tolerance

IEEE Transactions on Computers
On k-connectivity for a geometric random graph

Random Structures & Algorithms
Highly-resilient, energy-efficient multipath routing in wireless sensor networks

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
On the minimum node degree and connectivity of a wireless multihop network

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks

Proceedings of the 8th annual international conference on Mobile computing and networking
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Research Issues in Ad-Hoc Distributed Personal Networking

Wireless Personal Communications: An International Journal
ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies

IEEE Transactions on Mobile Computing
A Minimum Cost Heterogeneous Sensor Network with a Lifetime Constraint

IEEE Transactions on Mobile Computing
Prolonging the Lifetime of Wireless Sensor Networks via Prolonging the Lifetime of Wireless Sensor Networks via

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks

IEEE Transactions on Mobile Computing
Improving Protocol Robustness in Ad Hoc Networks through Cooperative Packet Caching and Shortest Multipath Routing

IEEE Transactions on Mobile Computing
On the upper bound of α-lifetime for large sensor networks

ACM Transactions on Sensor Networks (TOSN)
Redundancy and coverage detection in sensor networks

ACM Transactions on Sensor Networks (TOSN)
On Route Lifetime in Multihop Mobile Ad Hoc Networks

IEEE Transactions on Mobile Computing
Large Connectivity for Dynamic Random Geometric Graphs

IEEE Transactions on Mobile Computing
On the resilience of personal networks

ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
Connectivity properties of a packet radio network model

IEEE Transactions on Information Theory
On the connectivity of radio networks

IEEE Transactions on Information Theory

Position Unmanned Aerial Vehicles in the Mobile Ad Hoc Network

Journal of Intelligent and Robotic Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lifetime of node-to-node communication in a wireless ad hoc network is defined as the duration that two nodes can communicate with each other. Failure of the two nodes or failure of the last available route between them ends their communication. In this paper, we analyze the maximum lifetime of node-to-node communication in static ad hoc networks when alternative routes that keep the two nodes connected to each other are node-disjoint. We target ad hoc networks with random topology modeled as a random geometric graph. The analysis is provided for (1) networks that support automatic repeat request (ARQ) at the medium access control level and (2) networks that do not support ARQ. On the basis of this analysis, we propose numerical algorithms to predict at each moment of network operation, the maximum duration that two nodes can still communicate with each other. Then, we derive a closed-form expression for the expected value of maximum node-to-node communication lifetime in the network. As a byproduct of our analysis, we also derive upper and lower bounds on the lifetime of node-disjoint routes in static ad hoc networks. We verify the accuracy of our analysis using extensive simulation studies.