Lifetime extension of border nodes in SMAC-based wireless sensor networks by unifying multiple sleep schedules among adjacent virtual clusters

Abstract

In this paper, we propose a powerful but simple algorithm, termed as Schedule Unifying Algorithm (SUA), to minimize energy consumption by border nodes in sensor-MAC (S-MAC) based wireless sensor networks. SUA minimizes energy consumption by unifying the multiple listen and sleep schedules. We use NS-2 to implement and evaluate our algorithm. The experimental results show SUA incorporated S-MAC based nodes consume less energy thereby extends the lifetime 1.7 to 2.5 times more than that of S-MAC based border nodes. Consequently, this prolongs the time period over which two or more virtual clusters can communicate via a border node and therefore extends the lifetime of overall network.

Agent Based Approach to Minimize Energy Consumption for Border Nodes in Wireless Sensor Network

“…In this approach, the cost of transmitting more than once to different clusters is overlooked. In another approach, a boarder node selects one schedule that belongs to the higher synchronizer node [15]. The boarder node creates and unicastes a unifying packet, which contains the highest synchronizer' schedule to be used as a target schedule.…”

“…A node can be restricted to adapt to one schedule only of its neighbours [13] [15]. This will stop a node from becoming a border node.…”

A MAC Protocol with Little Idle Listening for Wireless Sensor Networks

“…Furthermore, the nodes bordering two or more virtual clusters adopt different listen and sleep schedules, so they consume more power than the others and are apt to be disabled. SUA applies a schedule unifying algorithm to unify multiple schedules, which eliminates the influence of bordering nodes [3]. But the schedule unifying algorithm needs a lot of communications to realize it.…”