A Location Aided Flooding Protocol for Wireless Ad Hoc Networks
Flooding in wireless ad hoc networks is a fundamental and critical operation in supporting various applications and protocols. However, the traditional flooding scheme generates excessive redundant packet retransmissions, causing contention, packet collis
- PDF / 342,789 Bytes
- 12 Pages / 430 x 660 pts Page_size
- 49 Downloads / 201 Views
，
1
School of Computer Science Wuhan University, Wuhan, China [email protected] 2 Wuhan Digital Engineering Research Institute, Wuhan, China [email protected] 3 Dept of Computer Science City University of Hong Kong, HongKong {jia@cs, liuhai@cs}cityu.edu.hk
，
Abstract. Flooding in wireless ad hoc networks is a fundamental and critical operation in supporting various applications and protocols. However, the traditional flooding scheme generates excessive redundant packet retransmissions, causing contention, packet collisions and ultimately wasting precious limited bandwidth and energy. In this paper, we propose an efficient flooding protocol called vertex forwarding which minimizes the flooding traffic by leveraging location information of 1-hop neighbor nodes. Our scheme works as if there were existing a hexagonal grid in the network field to guide the flooding procedure, only the vertex nodes which are located at or nearest to the vertices of the grid should be nominated to forward the message. We also provide a distributed algorithm for finding the vertex nodes. Simulation results show that our scheme is so efficient that it is almost able to reduce the number of forward nodes to the lower bound.
，
1 Introductions Flooding is a simple broadcast protocol for delivering a message to all nodes in a network. Many ad hoc network protocols (e.g., routing, service discovery, etc.) use flooding as the basic mechanism to propagate control messages. The simplest flooding technique is called pure flooding [1, 2]. In this scheme, every node in the network retransmits the flooding message when it receives it for the first time. Despite of its simplicity, pure flooding generates excessive amount of redundant network traffic, because it requires every node to retransmit the message. This will consume a lot of energy resource of mobile nodes and cause the congestion of the network. Furthermore, due to the broadcast nature of radio transmissions, there is a very high probability of signal collisions when all nodes flood the message in the network, which may cause some nodes fail to receive the flooding message. It is so called the broadcast storm problem [3]. Sinha et al [4] claimed that “in moderately sparse graphs the expected number of nodes in the network that will receive a broadcast message was shown to be as low as 80%.” To alleviate the broadcast storm problem, several efficient flooding schemes have been presented for ad hoc networks. The most notable works are in [5, 6, 7, 15, 17]. H. Zhang et al. (Eds.): MSN 2007, LNCS 4864, pp. 302–313, 2007. © Springer-Verlag Berlin Heidelberg 2007
A Location Aided Flooding Protocol for Wireless Ad Hoc Networks
303
However, these algorithms either perform poorly in reducing redundant transmissions, or require significant control overhead and intensive computation on nodes. For example, in [15, 17], each node is required to collect and maintain 2-hop neighbor information. Maintaining 2-hop neighbor information for each node incurs extra overhead of the system and the inform
Data Loading...
