Authors: Naeem Ahmad; S. Zeeshan Hussain
Addresses: Department of Computer Science, Jamia Millia Islamia (A Central University), New Delhi-25, India ' Department of Computer Science, Jamia Millia Islamia (A Central University), New Delhi-25, India
Abstract: In computer communication networks, every routing-protocol makes a route-discovery to find the optimal path which involves broadcasting of the query-packet over the network. It becomes too expensive when query-packets circulate unnecessarily in the network. These undesirable packets cause the problem of congestion in the network. Time-efficient BERS (tBERS) is one of the controlled flooding techniques that lessens such expenses. From our results, we analysed that its performance in terms of query-retransmission and link-breaks degrade as route-reconstruction problem increases. In such situations, we need to lessen the retransmission of query-packets due to link breaks. In this paper, we have proposed energy-efficient BERS (eBERS) technique that reduces the retransmission of the query-packets. It reduced the retransmission between the magnitude of 15%-20% and energy exhaustion ratio between 29%-56% in tBERS. Furthermore, eBERS also reduced the number of link breaks and average latency between 9%-25% and 36%-46%, respectively.
Keywords: unnecessary propagation; expanding ring search; ERS; weighted rough set; WRS; broadcasting; weight metric.
International Journal of Mobile Network Design and Innovation, 2017 Vol.7 No.3/4, pp.158 - 169
Available online: 04 Jan 2018 *Full-text access for editors Access for subscribers Purchase this article Comment on this article