Improving time-efficiency in blocking expanding ring search for mobile ad hoc networks

Pu, Ida; Stamate, Daniel; Shen, Yuji

doi:10.1016/j.jda.2013.03.006

Cited by 14 publications

(5 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Now we present a comparison between F&C and other repeal-based flooding schemes. BERS [ 12 ], tBERS, and tBERS* [ 17 ] were selected for this analysis since they are protocols comparable to F&C since they chase the initial flooding once the source and target nodes find each other. To evaluate the performance of such protocols and compared them to F&C, we performed simulations in SimPy [ 34 ].…”

Section: Experiments and Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Flood and Contain: An Optimized Repeal-Based Flooding Algorithm for Wireless Ad Hoc and Sensor Networks

Gómez

Montes-de-Oca

Camacho-Escoto

2020

Sensors

View full text Add to dashboard Cite

Flooding is a simple yet reliable way of discovering resources in wireless ad hoc networks such as mobile ad hoc networks (MANETs), ad hoc sensors, and recently, IoT networks. However, its operation is resource-intensive, especially in densely populated networks. Several approaches can be found in the literature to reduce the impact of flooding. Many of these approaches follow a repeal-based operation, chasing and stopping further propagation of flooding packets once the target is found. However, repeal-based protocols might end up transmitting even more packets than the original flooding. This work characterizes a maximum repeal-flooding boundary beyond which it is counterproductive to chase the original flooding. We present the Flood and Contain (F&C) algorithm, a method that can quickly establish the maximum repeal-flooding boundary for each node while making no assumptions on the underlying network. F&C’s packet overhead increases linearly with the hop count up to the maximum repeal-flooding boundary, in which case there is no attempt to chase the original flooding. In this latter case, F&C generates only as many packets as the original flooding. Simulations show that, on average, F&C reduces the total flooding overhead (compared to traditional flooding) up to 35 percent once considering all possible destinations, with only a slight increase in resource discovery latency, and it outperforms all other repeal-based protocols, particularly for longer routes.

show abstract

Section: Experiments and Resultsmentioning

confidence: 99%

“…An update was performed in BERS* [ 15 ] by halving the waiting time in each ring, thus speeding up the route discovery. In [ 17 ], the chase stage occurs in the receiver rather than in the source node as performed earlier. In [ 14 ], the authors used the ring as a boundary to retransmit the RQ at two different speeds.…”

Section: Related Workmentioning

confidence: 99%

Flood and Contain: An Optimized Repeal-Based Flooding Algorithm for Wireless Ad Hoc and Sensor Networks

Gómez

Montes-de-Oca

Camacho-Escoto

2020

Sensors

View full text Add to dashboard Cite

show abstract

“…The goal of confined techniques is preventing unnecessary circulation of query packets by limiting its hop count. Techniques like LBA [19], LHBA [20], revisiting-TTL ERS [21], blocking ERS [22], blocking ERS+ [15], BCIR [4], and tBERS [23] belong to this category. Chase-based strategy is used in almost all broadcasting techniques, revisiting-TTL ERS being an exception.…”

Section: Confined Broadcasting Techniquesmentioning

confidence: 99%

An Overview of Query-Broadcasting Techniques in Ad Hoc Networks

Ahmad¹,

Sethi²

2020

Mobile Computing

View full text Add to dashboard Cite

This chapter presents query-broadcasting techniques used to minimize expenses of the route discovery in ad hoc networks. A broad variety of such techniques have been proposed that improved the effectiveness and efficiency in various aspects of route discovery considering time and energy. Time-to-live based broadcast is the most common controlled flooding scheme widely used in routing protocols. One category of such techniques leveraged the routing history, while other category used broadcast repealing strategy to cancel the query-broadcast after successful route discovery.

show abstract

“…There is a trade-off between time efficiency and energy efficiency for protocols using chasing packets. More recent protocols such as Broadcast Cancellation Initiated from Resource (BCIR ) [10] and time-BERS (tBERS) [9], instead of waiting for the initiator node to start the cancellation process, start sending cancellation packets as soon as the resource is found. Both protocols improve time efficiency without additional energy costs.…”

Section: Related Workmentioning

confidence: 99%

“…Some energy efficient search mechanisms aim to attenuate the negative impact of flooding by limiting the query scope [8], [9], [10]. This can be achieved by intentionally delaying propagation, exploring a trade-off between energy This work is financed by the FCT − Fundação para a Ciência e a Tecnologia (Portuguese Foundation for Science and Technology) within project UID/EEA/50014/2013.…”

Section: Introductionmentioning

confidence: 99%

Adaptive Broadcast Cancellation Query Mechanism for Unstructured Networks

Lima

Baquero

Miranda

2015

2015 9th International Conference on Next Generation Mobile Applications, Services and Technologies

View full text Add to dashboard Cite

The availability of cheap wireless sensors boosted the emergence of unstructured networks using wireless technologies with decentralised administration. However, a simple task such as learning the temperature needs a discovery service to find a thermometer among all the sensors. In general, resource discovery relies on flooding mechanisms that waste energy and compromises system availability. Energy efficient strategies limit the exploration area, but with a significant impact on latency. The paper proposes ABC (Adaptive Broadcast Cancellation), a new algorithm that uses the knowledge acquired in previous discoveries to accelerate queries towards the resource. Knowledge is stored in a variation of Bloom filters, thus contributing for an efficient utilization of the sensors limited memory.

show abstract

Improving time-efficiency in blocking expanding ring search for mobile ad hoc networks

Abstract: We propose a new strategy for reducing the amount of latency and energy consumption in Block-

Cited by 14 publications

References 10 publications

Flood and Contain: An Optimized Repeal-Based Flooding Algorithm for Wireless Ad Hoc and Sensor Networks

Flood and Contain: An Optimized Repeal-Based Flooding Algorithm for Wireless Ad Hoc and Sensor Networks

An Overview of Query-Broadcasting Techniques in Ad Hoc Networks

Adaptive Broadcast Cancellation Query Mechanism for Unstructured Networks

Contact Info

Product

Resources

About