DocumentCode
1401486
Title
Increasing the One-Hop Progress of Nearest Neighbor Forwarding
Author
Tanbourgi, Ralph ; Jäkel, Holger ; Jondral, Friedrich K.
Author_Institution
Commun. Eng. Lab. (CEL), Karlsruhe Inst. of Technol. (KIT), Karlsruhe, Germany
Volume
15
Issue
1
fYear
2011
fDate
1/1/2011 12:00:00 AM
Firstpage
64
Lastpage
66
Abstract
Nearest neighbor forwarding (NNF) intends to maximize throughput in wireless networks. However, NNF suffers from low one-hop progress and may therefore significantly increase end-to-end delay. The spatial efficiency (SE), i.e., the expectation of the ratio of progress to interference area associated with one hop, is introduced in order to quantify this trade-off. The problem of low progress is addressed by maximizing the one-hop SE, subject to the central angle γ, determining the forwarding area. By this, the optimal balance between minimizing the interference area and maximizing progress is found. Then, this analysis is extended by considering a Poisson point process, driven by some traffic intensity, on the interference area. Furthermore, the traffic aware γ*-NNF strategy is proposed which adapts γ to the traffic intensity in order to maximize SE. Simulation results show a significant reduction of the end-to-end delay if γ*-NNF is used.
Keywords
radio networks; radiofrequency interference; stochastic processes; telecommunication network routing; telecommunication traffic; NNF; Poisson point process; end-to-end delay; interference; nearest neighbor forwarding; one-hop spatial efficiency; traffic intensity; wireless network; Boolean functions; Data structures; Delay; Interference; Relays; Throughput; Wireless networks; Poisson point process; Wireless networks; greedy geographic routing;
fLanguage
English
Journal_Title
Communications Letters, IEEE
Publisher
ieee
ISSN
1089-7798
Type
jour
DOI
10.1109/LCOMM.2010.120610.101299
Filename
5665738
Link To Document