Download now Free registration required
Recent developments in sensor technology, as seen in Berkeley's Mica2 Mote, Rockwell's WINS nodes and the IEEE 802.15.4 Zigbee, have enabled support for single-transceiver, multi-channel communication. The task of channel assignment with minimum interference, also named as the 2-hop coloring problem, allows repetition of colors occurs only if the nodes are separated by more than 2 hops. Being NP complete, development of efficient heuristics for this coloring problem is an open research area and this paper proposes the Dynamic Channel Allocation (DCA) algorithm as a novel solution. Once channels are assigned, a medium access control protocol must be devised so that channel selection, arbitration and scheduling occur with maximum energy savings and reduced message overhead, both critical considerations for sensor networks.
- Format: PDF
- Size: 389.4 KB