Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Delay‐insensitive identification of neighbors using unslotted and slotted protocols

Delay‐insensitive identification of neighbors using unslotted and slotted protocols For many applications, it is desirable for a node to be able to identify the neighbor nodes currently within range. However, the identification procedures for terrestrial communication networks (TCNs) are inefficient when implemented in long‐delay networks (LDNs) such as underwater acoustic networks or satellite networks, where the propagation time of a packet cannot be neglected. Here, we propose a time‐efficient and power‐efficient procedure, which is insensitive to propagation delay, for identifying neighbors in an LDN by optimizing the network offered load using either unslotted or slotted protocols. The procedure is adapted to the scenario when node cardinality and distribution are either known or unknown in advance. We achieve improvements as high as 80% in time and 45% in power consumption for our proposed approach compared with approaches developed previously for TCN. Furthermore, we analyze our proposed approach with the inclusion of the capture effect and packet receive time variations. We also provide a closed form formula for finding the optimum guard time and a procedure to estimate the packet receive time variations. Copyright © 2012 John Wiley & Sons, Ltd. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Wireless Communications & Mobile Computing Wiley

Delay‐insensitive identification of neighbors using unslotted and slotted protocols

18 pages

Loading next page...
 
/lp/wiley/delay-insensitive-identification-of-neighbors-using-unslotted-and-qHrp1I6zbF

References (32)

Publisher
Wiley
Copyright
"Copyright © 2014 John Wiley & Sons, Ltd."
ISSN
1530-8669
eISSN
1530-8677
DOI
10.1002/wcm.2242
Publisher site
See Article on Publisher Site

Abstract

For many applications, it is desirable for a node to be able to identify the neighbor nodes currently within range. However, the identification procedures for terrestrial communication networks (TCNs) are inefficient when implemented in long‐delay networks (LDNs) such as underwater acoustic networks or satellite networks, where the propagation time of a packet cannot be neglected. Here, we propose a time‐efficient and power‐efficient procedure, which is insensitive to propagation delay, for identifying neighbors in an LDN by optimizing the network offered load using either unslotted or slotted protocols. The procedure is adapted to the scenario when node cardinality and distribution are either known or unknown in advance. We achieve improvements as high as 80% in time and 45% in power consumption for our proposed approach compared with approaches developed previously for TCN. Furthermore, we analyze our proposed approach with the inclusion of the capture effect and packet receive time variations. We also provide a closed form formula for finding the optimum guard time and a procedure to estimate the packet receive time variations. Copyright © 2012 John Wiley & Sons, Ltd.

Journal

Wireless Communications & Mobile ComputingWiley

Published: Oct 10, 2014

Keywords: ; ; ; ; ;

There are no references for this article.