Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Distributed Minimal Time Convergecast Scheduling in Wireless Sensor Networks
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
The problem of medium access control in wireless sensor networks
IEEE Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
Collision-minimizing CSMA and its applications to wireless sensor networks
IEEE Journal on Selected Areas in Communications
Information discovery in mission-critical wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Review: From wireless sensor networks towards cyber physical systems
Pervasive and Mobile Computing
Survey Paper: A survey on multi-channel communication in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal time data gathering in wireless networks with omni-directional antennas
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Interference-free scheduling with bounded delay in cluster-tree wireless sensor networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We investigate a unique wireless sensor network scheduling problem in which all nodes in a cluster send exactly one packet to a designated sink node in an effort to minimize transmission time. However, node transmissions must be sufficiently isolated either in time or in space to avoid collisions. The problem is formulated and solved via graph representation. We prove that an optimal transmission schedule can be obtained efficiently through a pipeline-like schedule when the underlying topology is either line or tree. The minimum time required for a line or tree topology with n nodes is 3(n - 2). We further prove that our scheduling problem is NP-hard for general graphs. We propose a heuristic algorithm for general graphs. Our heuristic tries to schedule as many independent segments as possible to increase the degree of parallel transmissions. This algorithm is compared to an RTS/CTS based distributed algorithm. Preliminary simulated results indicate that our heuristic algorithm outperforms the RTS/CTS based distributed algorithm (up to 30%) and exhibits stable behavior.