A Self-organizing Cluster Agent for Routing Algorithm in Wireless Sensor Networks

Authors:
Sangjoon Jung;Younky Chung;Chonggun Kim
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;Dept. of Computer Engineering, Yeungnam University, 712-749, 214-1, Dae-dong, Gyeongsan-si, Gyeongsangbuk-do, Korea
Venue:
KES-AMSTA '07 Proceedings of the 1st KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Year:
2007

Citing 7
Cited 0

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
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
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

Developing sensor networks enable us to gather information about specified regions or tasks. Sensing nodes have several characteristics to have constrained energy and limited capacity. So, minimizing energy consumption and maximizing system lifetime have been a major issue for wireless sensor networks. What is unique about our proposed agent approach is that the agent has a learning capability using cluster configuration technique while the fitness criterion is based on energy consumption, election of cluster heads, and the number of clusters. This paper proposes an energy-efficient routing algorithm based on organizing clusters in sensing area by electing agents called cluster heads. This strategy allows an agent as cluster head to keep a routing table about intermediary nodes that can communicate between different clusters. The agent gathers routing information to establish routing paths by intermediary nodes and to decide an appropriate path by the routing table. When a sink node diffuses an interest, an agent finds neighbor clusters to reach to the sink node and transmits a response to intermediary nodes. The intermediary node then transmits the response to the agent. Thus, the agent decides to report to the sink node. This mechanism gives sensor nodes lower consumption of energy and prolonging system lifetime.