Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
A directionality based location discovery scheme for wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Detecting Malicious Beacon Nodes for Secure Location Discovery in Wireless Sensor Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
IEEE Transactions on Mobile Computing
A Logical Group Formation and Management Mechanism Using RSSI for Wireless Sensor Networks
APNOMS '08 Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management
Hi-index | 0.00 |
In a multihop Wireless Sensor Network (WSN), a salient point among routing protocols that do not depend on network topology and existence of neighboring nodes is the need to know sensor node's geographical location with respect to the sink node. This is obtained by some means like Global Positioning System (GPS) and localization techniques. In a prior work, we have proposed RSSI-based Forwarding (RBF) protocol that works without knowledge of node's location by using a Received Signal Strength Indicator (RSSI) level of beacon signals transmitted by the sink. Through contention, a next-hop node is determined among the forwarding candidates using a timer-based suppression scheme. We propose an improvement of the suppression scheme in which a contender closer to the sink is favored with a higher probability for being selected as a next-hop node. By means of simulation, it is shown that the performance of RBF is significantly improved using the enhanced mechanism.