Details

Autor(en) / Beteiligte

• Jung, Sangjoon
• Chung, Younky
• Kim, Chonggun
• Grzech, Adam
• Howlett, Robert J.
• Jain, Lakhmi C.
• Nguyen, Ngoc Thanh

Titel

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

Ist Teil von

• Agent and Multi-Agent Systems: Technologies and Applications, p.711-720

Ort / Verlag

Berlin, Heidelberg: Springer Berlin Heidelberg

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• 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.