Proxy-assisted routing for efficient data transmission in mobile ad hoc networks

Abstract

While on-demand routing protocols have been optimized to use the aid of proxy nodes by considering the possibility of long-lived partitions due to intermittent connectivity, they do not consider the chances of using a proxy for a long distance between a pair of source and destination. In this paper, we introduce a Proxy-Assisted Routing (PART) for efficient data transmission by selecting a proxy node for every path length that is longer than the predefined value between a source and destination. Whenever route errors occur between a source node and proxy node, or a proxy node and destination node, the proxy node repairs a broken route locally by redirecting a new route to the source or destination node. To reduce routing overhead, we delineate a broadcasting zone, where nodes are only allowed to broadcast request packets within the predefined zone to the proxy. Furthermore, unicast transmission is used for the proxy selection process using IP address information at the MAC layer. When we evaluate the performance metrics through simulations, PART significantly reduces the normalized routing load by almost 55% and the packet losses by almost 30%, and increases throughput almost 70% if compared to the traditional routing protocols.

A proxy acknowledgement mechanism for TCP variants in mobile ad hoc networks

“…As mentioned in our paper [14], a middle node is selected as a proxy node according to the path length or hop count (HC). When a destination node receives a route request packet (RREQ), it decides whether to use the assistance of a proxy node by checking the HC of RREQ.…”

“…Otherwise, RREP packet is forwarded to the next hop. Proxy-assistance routing (PART) and its detail routing mechanism are referred to our paper [14].…”

A Proxy Acknowledgement Mechanism for TCP Variants in Mobile Ad Hoc Networks

“…The proxy selection process is the function of routing layer protocol. As mentioned in our paper [14], a middle node is selected as a proxy node according to the path length or hop count (HC). When a destination node receives a route request packet (RREQ), it decides whether to use the assistance of a proxy node by checking the HC of RREQ.…”

A hash‐based distributed mapping control scheme in mobile locator‐identifier separation protocol networks

“…For most of today's business and private communications, the Internet has become the nervous system, and the rising connections of the systems and networks to the Internet has been rapidly increasing . Many networks connected to several Internet service providers through multiple points of attachment for reliable interconnection.…”