Abstract
In a broadcasting task, source node wants to send the same message to all the other nodes in the network. Existing solutions range from connected dominating set (CDS) based on static networks to blind flooding for moderate mobility and hyper-flooding for highly mobile and frequently partitioned networks. Existing protocols for all scenarios are based on some threshold parameters (e.g. speed, which may be expensive to gather) to locally select between these three solution approaches. Here, we describe a new seamless broadcasting from static to mobile protocol, which adjusts itself to any mobility scenario without using any mobility or density-related parameter. Unlike existing methods for highly mobile scenarios, in the proposed method, two nodes do not transmit every time they discover each other as new neighbours. Each node maintains a list of two hop neighbours by periodically exchanging ‘hello’ messages, and decides whether or not it is in CDS. Upon receiving the first copy of message intended for broadcasting, it selects a waiting timeout and constructs two lists of neighbours: neighbours that received the same message and neighbours that did not receive it. Nodes not in CDS select longer timeouts than nodes in CDS. These lists are updated upon receiving further copies of the same packet. When timeout expires, node retransmits if the list of neighbours in need of message is non-empty. ‘Hello’ messages received while waiting, or after timeout expiration may revise all lists (and CDS status) and consequently the need to retransmit. This provides a seamless transition of protocol behaviour from static to highly mobile scenarios, which is applicable to a variety of multi-hop wireless networks.
Published Version
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 call