Abstract
The amount of route search (RS) packets in Ad Hoc networks depend on the usage of network node location data and signal strength levels for defining response zones and sending RS packets. In case when route response zones are not restricted in every next step of the routing process, the number of generated RS packets grows according to the geometric progression. When node location data and signal strength level is used, the number of RS packets generated at the next routing step increases according to the arithmetic progression or may be constant. It has been shown in the paper that response zone restrictions help to reduce the number of generated RS packets significantly in high density network, while exploiting the location data and signal strength level in lower density network is less efficient. Ill. 5, bibl. 10, tabl. 1 (in English; abstracts in English and Lithuanian). http://dx.doi.org/10.5755/j01.eee.115.9.744
Highlights
A mobile Ad Hoc network consists of mobile nodes that self-organize into a network and communicate via wireless links as hosts sending and receiving data packets and as routers performing user data packet routing
The results indicate that the denser the network, the larger the amount of route search (RS) packets is generated
The route search packets are generated in the network during the routing process
Summary
A mobile Ad Hoc network consists of mobile nodes that self-organize into a network and communicate via wireless links as hosts sending and receiving data packets and as routers performing user data packet routing. The routing process consists of a number of steps in which route search (RS) packets are being sent. Various routing algorithms for Ad Hoc networks do not change the response zones as network topology varies and do not guarantee the smallest possible number of RS packets [2]. Response zone of a node is a space, where nodes forward received RS packets further to the network. In this way, new response zones are formed at every step of the routing process. Greedy routing is a routing method in which RS packets are sent through the single node that is closest to the destination node in each RS step. The objective of the research is to determine the dependences of RS packet flow parameters on the density of network nodes for different flooding-based and greedy routing algorithms
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
