A sowing routing protocol for dense mobile ad hoc networks

To reduce the number of control messages in dense ad-hoc networks, some protocols reduce the redundancy (or overlap) between communication radii to limit the routing overhead. In this paper, we propose a novel method to decrease the routing overhead by reducing redundancy of data between neighbors: a node selectively sends routing information that was not recently sent by neighbors, and transmits it using the payload of HELLO messages. In addition, the node introduces a bias favoring information pertaining to nearby nodes, as information about farther nodes need to be updated less often. When a route is needed, the route request message is relayed only by nodes that are closer to the destination, thus forming a broadcast limited to a subset of the network. The protocol, called SiRuP (Sowing Routing Protocol) provides a low-overhead routing for dense networks and offers good resistance against route request failures, when nodes are highly mobile.リサーチレポート（北陸先端科学技術大学院大学情報科学研究科