ON THE COVERAGE AREA IN BROADCAST AD HOC NETWORKS

被引：0

作者：

Ma, Xiaomin ^{[1
]}

Zhang, Jinsong ^{[2
]}

机构：

[1] Oral Roberts Univ, Sch Sci & Engn, Tulsa, OK 74171 USA

[2] Univ Tulsa, 2Department Elect Engn, Tulsa, OK USA

来源：

PROCEEDINGS OF THE 3RD IEEE INTERNATIONAL CONFERENCE ON NETWORK INFRASTRUCTURE AND DIGITAL CONTENT (IEEE IC-NIDC 2012) | 2012年

关键词：

Potential hidden node area; Rebroadcast coverage area; Mobile ad hoc networks; Broadcast;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we first define the problem of computation of the potential hidden node area and the extra coverage area that can benefit from rebroadcasts in broadcast ad hoc networks and abstract two types of computations as a geometric coverage area computation problem. Then, under two distinct distributions of the nodes in the network, we derive the closed-form expressions of the cumulative distribution functions and the probability density functions of the distance between the source node and the nodes (especially, the farthest node) within its transmission range. Finally, the defined coverage area can be derived through the density functions in one-dimensional case. This calculation can be beneficial to the design and analysis of multi-hop broadcast ad hoc networks.

引用

页码：13 / 17

页数：5

共 10 条

[1]

[Anonymous], 2003, E221303 ASTM

[2]

Cheng Y., 1989, IEEE T COMMUNICATION, V37

[3]

Choi JM, 2005, LECT NOTES COMPUT SC, V3391, P1

[4]

DARPA, ARM COLL FUT COMB SY

[5]

Haenggi M., 2005, IEEE T INFORM THEORY, V5

[6]

Li XY, 2004, LECT NOTES COMPUT SC, V3158, P172

[7]

Torrent-Moreno Marc., 2004, VANET 04, P10

[8]

Trivedi KishorS., 2002, PROBABILITY STAT REL, V2nd

[9] Predictive models to rebroadcast in Mobile Ad hoc NETworks [J].

Williams, B ;

Mehta, DP ;

Camp, T ;

Navidi, W .

IEEE TRANSACTIONS ON MOBILE COMPUTING, 2004, 3 (03) :295-303

[10]

Zhang H., 2006, PERFORM EVALUATION, V63, P1196

← 1 →