Handling Neighbor Discovery and Rendezvous Consistency with Weighted Quorum-Based Approach

Abstract

Neighbor discovery and the power of sensors play an important role in the formation of Wireless Sensor Networks (WSNs) and mobile networks. Many asynchronous protocols based on wake-up time scheduling have been proposed to enable neighbor discovery among neighboring nodes for the energy saving, especially in the difficulty of clock synchronization. However, existing researches are divided two parts with the neighbor-discovery methods, one is the quorum-based protocols and the other is co-primality based protocols. Their distinction is on the arrangements of time slots, the former uses the quorums in the matrix, the latter adopts the numerical analysis. In our study, we propose the weighted heuristic quorum system (WQS), which is based on the quorum algorithm to eliminate redundant paths of active slots. We demonstrate the specification of our system: fewer active slots are required, the referring rate is balanced, and remaining power is considered particularly when a device maintains rendezvous with discovered neighbors. The evaluation results showed that our proposed method can effectively reschedule the active slots and save the computing time of the network system.

A Fast Neighbor Discovery Algorithm in WSNs

“…The earliest deterministic neighbor discovery protocols are quorum-based ones [21,22,29], where time is divided into m 2 slots. These slots can be regarded as a two-dimensional array.…”

“…Quorum-based [21,22,29]; Prime-based: Disco [23], U-connect 2 [24]; Searchlight [7]; Unequal-sized Slot methods [7,25,26]; Block-based [8,27]; middleware methods WiFlock [13], Acc 3 [14], EQS 4 [9], Group [10] 1 prime-set-based algorithm; 2 unified connect; 3 on-demand accelerations; 4 extended quorum systems.…”

Collective Neighbour Discovery in Wireless Sensor Network

“…That means one of them is the sender, while the rest of them are receivers [11]. There are quorum based protocols where each node chooses one row and one column active slots entries in m × m matrix [4,12]. The main limitation of this protocol is that in average case the performance may worsen due to extra intersection [9].…”

On the Dynamic RSS Feedbacks of Indoor Fingerprinting Databases for Localization Reliability Improvement

“…Although global positioning systems can provide accurate and reliable position information for location services, they cannot be used effectively indoors. Recently, numerous localization methods, such as those involving sensor networks, radio frequency identification, wireless fidelity (WiFi), Bluetooth low energy (BLE), and visual light positioning, have been proposed to overcome this limitation; among them, the use of BLE positioning technology has attracted widespread attention because it is based on mobile phones—most notably the iPhone—which are extensively used worldwide [ 1 ].…”

“…When the system boots up, mobile devices receive the system’s unique RSS value; the devices subsequently search the fingerprinting database and identify the entry that is most similar to the system’s unique RSS value for the estimated location [ 2 ]. The main problem of a typical RSS fingerprinting system is that the real RSS value at any location is easily affected by the object and multipath fading effects [ 1 ]. In other words, the RSS fingerprint obtained at different times needs not match the previous fingerprint stored in the database, leading to incorrect estimation results.…”