Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Distributed code assignments for CDMA Packet Radio Network
IEEE/ACM Transactions on Networking (TON)
Code assignment for hidden terminal interference avoidance in multihop packet radio networks
IEEE/ACM Transactions on Networking (TON)
Assigning codes in wireless networks: bounds and scaling properties
Wireless Networks
Topology management for sensor networks: exploiting latency and density
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Optimizing Sensor Networks in the Energy-Latency-Density Design Space
IEEE Transactions on Mobile Computing
Distributed On-Demand Address Assignment in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Minimal CDMA Recoding Strategies in Power-Controlled Ad-Hoc Wireless Networks
Minimal CDMA Recoding Strategies in Power-Controlled Ad-Hoc Wireless Networks
An adaptive energy-efficient MAC protocol for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
A study of energy consumption and reliability in a multi-hop sensor network
ACM SIGMOBILE Mobile Computing and Communications Review - Special issue on wireless pan & sensor networks
Implementing software on resource-constrained mobile sensors: experiences with Impala and ZebraNet
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Medium access control with coordinated adaptive sleeping for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
A MAC Protocol to Reduce Sensor Network Energy Consumption Using a Wakeup Radio
IEEE Transactions on Mobile Computing
An adaptive coordinated medium access control for wireless sensor networks
ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
IEEE Communications Magazine
Quality of Service in mobile ad hoc networks: a survey
International Journal of Ad Hoc and Ubiquitous Computing
Channel selection in spectrum agile and cognitive MAC protocols for wireless sensor networks
Proceedings of the 8th ACM international workshop on Mobility management and wireless access
A route-aware MAC for wireless multihop networks with a convergecast traffic pattern
Computer Networks: The International Journal of Computer and Telecommunications Networking
WiSpot: fast and reliable detection of Wi-Fi networks using IEEE 802.15.4 radios
Proceedings of the 9th ACM international symposium on Mobility management and wireless access
A distributed and collaborative scheme for mitigating coexistence in IEEE 802.15.4 based WBANs
Proceedings of the 50th Annual Southeast Regional Conference
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance Comparison of Two Channel Allocation Strategies in Cellular Networks
Wireless Personal Communications: An International Journal
A Graph Route-Based Superframe Scheduling Scheme in WirelessHART Mesh Networks for High Robustness
Wireless Personal Communications: An International Journal
How many wireless resources are needed to resolve the hidden terminal problem?
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
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. The contribution of this paper is twofold: (1) development and analysis of the DCA algorithm that assigns optimally minimum channels in a distributed manner in order to make subsequent communication free from both primary and secondary interference and (2) proposing CMAC, a fully desynchronized multi-channel MAC protocol with minimum hardware requirements. CMAC takes into account the fundamental energy constraint in sensor nodes by placing them in a default sleep mode as far as possible, enables spatial channel re-use and ensures nearly collision free communication. Simulation results reveal that the DCA consumes significantly less energy while giving a legal distributed coloring. CMAC, our MAC protocol that leverages this coloring, has been thoroughly evaluated with various modes in SMAC, a recent protocol that achieves energy savings through coordinated sleeping. Results show that CMAC obtains nearly 200% reduction in energy consumption, significantly improved throughput, and end-to-end delay values that are 50-150% better than SMAC for our simulated topologies.