On hop count and Euclidean distance in greedy forwarding in wireless ad hoc networks

被引：28

作者：

De, S ^{[1
]}

机构：

[1] New Jersey Inst Technol, Dept Elect & Comp Engn, Newark, NJ 07102 USA

来源：

IEEE COMMUNICATIONS LETTERS | 2005年 / 9卷 / 11期

基金：

美国国家科学基金会;

关键词：

ad hoc networks; sensor networks; greedy routing; probabilistic bounds;

D O I：

10.1109/LCOMM.2005.11019

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

In this letter, a probabilistic analysis is presented that captures the bounds on hop count from a given Euclidean distance between two nodes and vice versa in a greedy forwarding in wireless ad hoe networks. Accuracy of the analysis is verified via network simulations. The results could be useful in ad hoc and sensor network design and performance evaluation.

引用

页码：1000 / 1002

页数：3

共 8 条

[1]

[Anonymous], P IEEE NAT TEL C DEC

[2]

Hekmat R, 2003, ICON 2003: 11TH IEEE INTERNATIONAL CONFERENCE ON NETWORKS, P603

[3] TRANSMISSION RANGE CONTROL IN MULTIHOP PACKET RADIO NETWORKS [J].

HOU, TC ;

LI, VOK .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1986, 34 (01) :38-44

[4]

Karp B., 2000, MobiCom 2000. Proceedings of the Sixth Annual International Conference on Mobile Computing and Networking, P243, DOI 10.1145/345910.345953

[5] A survey on position-bosed routing in mobile ad hoc networks [J].

Mauve, M ;

Widmer, J ;

Hartenstein, H .

IEEE NETWORK, 2001, 15 (06) :30-39

[6]

Nagpal R, 2003, LECT NOTES COMPUT SC, V2634, P333

[7]

RAO A, 2003, P 9 ANN INT C MOB CO, P96, DOI [DOI 10.1145/938985.938996, 10.1145/938985.938996]

[8] OPTIMAL TRANSMISSION RANGES FOR RANDOMLY DISTRIBUTED PACKET RADIO TERMINALS [J].

TAKAGI, H ;

KLEINROCK, L .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1984, 32 (03) :246-257

← 1 →