Abstract
The problem of routing in mobile adhoc network has been approached in different methods. However, they suffer to achieve the required performance in quality of service. The mobile nodes spent most of the energy on routing because of cooperative transmission. To improve the performance of mobile adhoc network, an efficient LMHP routing algorithm is proposed in this paper. The source node discovers the route by sending LMHP route discovery (LMHP-RD) message to all its neighbors, identified in the neighbor discovery phase. The neighbors reply the LMHP-route request (RREQ) packet to the source node which contains power and displacement information about the intermediate nodes. The source node collects the information about the routes available along with power and displacement details. Using the identified information, the source node computes the transmission completeness weight for each route. Based on computed transmission completeness weight, the method selects a single route with maximum weight to perform data transmission. This method improves the throughput performance and increases the lifetime of the network. The proposed system is developed and simulated in NS2 and the performance has been analyzed based on three metrics Throughput, pocket delivery ratio and latency ratio. The simulated results show that the power consumption is relatively low in the proposed method, comparing the available techniques.
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.
