Lifetime analysis of a sensor network with hybrid automata modelling
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
An adaptive energy-efficient MAC protocol for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Versatile low power media access for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
ExScal: Elements of an Extreme Scale Wireless Sensor Network
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Trio: enabling sustainable and scalable outdoor wireless sensor network deployments
Proceedings of the 5th international conference on Information processing in sensor networks
PEDAMACS: Power Efficient and Delay Aware Medium Access Protocol for Sensor Networks
IEEE Transactions on Mobile Computing
A TDMA scheduling scheme for many-to-one communications in wireless sensor networks
Computer Communications
SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
TreeMAC: Localized TDMA MAC protocol for real-time high-data-rate sensor networks
Pervasive and Mobile Computing
On maximizing the throughput of convergecast in wireless sensor networks
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
TDMA scheduling algorithms for wireless sensor networks
Wireless Networks
IEEE Transactions on Mobile Computing
Fast Data Collection in Tree-Based Wireless Sensor Networks
IEEE Transactions on Mobile Computing
The capacity of wireless networks
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
The multihop configuration of a large-scale wireless sensor network enables multiple simultaneous transmissions without interference within the network. Existing time division multiple access (TDMA) scheduling schemes exploit gain based on the assumption that the path is optimally determined by a routing protocol. In contrast, our scheme jointly considers routing and scheduling and introduces several new concepts. We model a large-scale wireless sensor network as a tiered graph relative to its distance from the sink, and introduce the notion of relay graph and relay factor to direct the next-hop candidates toward the sink fairly and efficiently. The sink develops a transmission and reception schedule for the sensor nodes based on the tiered graph search for a set of nodes that can simultaneously transmit and receive. The resulting schedule eventually allows data from each sensor node to be delivered to the sink. We analyze our scheduling algorithm both numerically and by simulation, and we discuss the impact of protocol parameters. Further, we prove that our scheme is scalable to the number of nodes, from the perspectives of mean channel capacity and maximum number of concurrent transmission nodes. Compared with the existing TDMA scheduling schemes, our scheme shows better performance in network throughput, path length, end-to-end delay, and fairness index.