A Proactive Routing Algorithm Based on Bitmap Tables for Wireless Sensor Networks

Authors:
Sangjoon Jung;Younky Chung
Affiliations:
School of Computer Engineering, Kyungil University, 712-701, 33 Buho-ri, Hayang-up, Gyeongsan-si, Gyeongsang buk-do, Korea;School of Computer Engineering, Kyungil University, 712-701, 33 Buho-ri, Hayang-up, Gyeongsan-si, Gyeongsang buk-do, Korea
Venue:
KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
Year:
2007

Citing 9
Cited 0

Adaptive protocols for information dissemination in wireless sensor networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: scalable coordination in sensor networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Directed diffusion: a scalable and robust communication paradigm for sensor networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
An architecture for building self-configurable systems

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
A taxonomy of wireless micro-sensor network models

ACM SIGMOBILE Mobile Computing and Communications Review
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Low-Power Wireless Sensor Networks

VLSID '01 Proceedings of the The 14th International Conference on VLSI Design (VLSID '01)
Efficient clustering algorithms for self-organizing wireless sensor networks

Ad Hoc Networks
Minimum energy mobile wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current routing protocols in the sensor network focus on finding energy-efficient route setup so that the lifetime of the network is maximized. They do not use a routing table to decide the route due to increasing memory and updating costs. However, this paper proposes a new routing algorithm to broadcast a routing table to reduce the number of messages transferred to setup the routing path. The routing table is formed with a two-dimensional array, where each row and column is represented by one bit. When a node receives a request message, it updates its routing table after broadcasting. Thus, each node has a routing table with partial link information, which allows them to give much alternative route to the sink node. The proposed routing algorithm reduces the number of required messages for the routing establishment and preserves larger remained energy in compared to the previous algorithms.