International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 50 - Number 7 |
Year of Publication: 2012 |
Authors: Sangita V. Kurundkar, Atul S. Dhakate, Animesh S. Kopekar |
10.5120/7783-0879 |
Sangita V. Kurundkar, Atul S. Dhakate, Animesh S. Kopekar . Range Optimization Protocol for Efficient Localization and Data Routing. International Journal of Computer Applications. 50, 7 ( July 2012), 19-26. DOI=10.5120/7783-0879
Over a last few decades there has been a substantial growth in many technical fields, which also cherished the sensors technology, low-power integrated circuits, wireless communications etc. These developments have enabled the design of low-cost, miniature, lightweight and intelligent sensor nodes. We can program these nodes to work according to our requirement and response according to the situation. These nodes are made capable of sensing, processing and communicating. With the rapid advancements in the technologies of software, hardware and communication methods a complete new range of communication network called Mobile Ad-Hoc Network (MANET) is being developed over a last couple of decades. Mobile Ad-Hoc Network holds a tremendous inbound potential, of which a lot has been discovered in the fields of effective bandwidth utilization, link weight awareness (LUNAR, OLSR), multicasting (PUMA), power source awareness, hybrid protocols (HAPR), biology inspired technologies (BISON), table driven and on-demand protocols (AODV), network life time optimization etc. and to these factors the network is made adaptive to the dynamic conditions; yet it is found that a lot of exploration could be done in some areas such as the efficient geometric arrangements of the nodes, method of power efficient routing, localization of the nodes, broadcasting and multicasting techniques, network formation and adaptation abilities and methods. In this paper, a systematic geometric approach to increase the range of a node is discussed. The concept is to temporarily arrange the nodes in specific formations so that the range of any node in the network can be extended virtually, making the data routing efficient in terms of energy consumption, delay, reduce error occurrences and time complexity. Some of the related theoretical results and NS2 simulation results of the geometric approach are discussed.