Loading...
On the route discovery rate of flooding in large wireless networks
Shah-Mansouri, H ; Sharif University of Technology | 2012
747
Viewed
- Type of Document: Article
- DOI: 10.1109/PIMRC.2012.6362535
- Publisher: 2012
- Abstract:
- In this paper, we derive the rate of route discovery process for finding a randomly chosen destination in large wireless networks. The well-known protocol for route discovery is flooding in which each node simply rebroadcasts the route request packet once. Rate of route discovery process is defined as the inverse of time between transmitting two successive route request packets which shows how fast a node can request a route to its destination. Discovery time is another parameter of interest. For a single node discovering routes to its destination, at most the rate of Eθ (1/3√n) is feasible when n identical nodes are optimally placed in network area and the discovery time is of order Eθ(3√n). Achievability of such rate is obtained through optimal placement and hierarchical scheduling of nodes transmissions
- Keywords:
- Achievable rate ; Flooding ; Large scale wireless networks ; Route discovery rate ; Upper bound ; Achievability ; Hierarchical scheduling ; Network area ; Optimal placements ; Route discovery ; Route discovery process ; Route request packets ; Oil well flooding ; Wireless networks ; Floods
- Source: IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC ; 2012 , Pages 1238-1242 ; 9781467325691 (ISBN)
- URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6362535