A Generalised Energy-Efficient Time-Based Communication Protocol for Wireless Sensor Networks

Review of Optimization Problems in Wireless Sensor Networks

“…The respective optimization problem is the chromatic graph optimization problem, which aims to minimize the number of colors used to color the nodes such that two neighbor elements do not use the same color. This problem is addressed in several works that have put forward a number of distributed algorithms (Al-Khdour & Baroudi, 2010;Gandham et al, 2005;Kawano & Miyazaki, 2009;Sridharan & Krishnamachari, 2004). In (Sridharan & Krishnamachari, 2004) slot allocation uses the logic of a breadth-first search algorithm where the first node which allocates the slot is the root of the tree (the sink).…”

“…Then, edge orientation is applied to the edges with the same color. So, for instance, in The same problem is reexamined by (Al-Khdour & Baroudi, 2010), under the assumption that nodes can communicate with different frequencies. Nowadays radio chips support multichannel transceivers which can help to reduce the number of required time slots in a TDMA frame.…”

Optimization Problems in Wireless Sensor Networks

“…This problem is of the same difficulty and directly convertible to the vertex cover, independent set computation problem, or the maximum clique one. [57] proposes a method to obtain the CDS which is basically built in two phases: During the first phase, a Maximal Independent Set (MIS) 3 is formed. In the second phase, the goal is to build a CDS using nodes that do not belong to the M IS.…”

“…They evaluate their algorithms by using as criteria the number of packet collisions in the network. This slot allocation mechanism is also encountered in [3], [30], [50]. In contrast with the others, the work in [3] assumes different frequencies for transmission and receiving which results in reducing the number of time slots in the frame.…”

“…This slot allocation mechanism is also encountered in [3], [30], [50]. In contrast with the others, the work in [3] assumes different frequencies for transmission and receiving which results in reducing the number of time slots in the frame. The authors describe also the construction of an energyaware data gathering tree to ensure that all data are delivered to the sink.…”