Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Negotiation-based protocols for disseminating information in wireless sensor networks
Wireless Networks - Selected Papers from Mobicom'99
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Hybrid routing in ad hoc networks with a dynamic virtual backbone
IEEE Transactions on Wireless Communications
A power-efficient secure routing protocol for wireless sensor networks
WSEAS Transactions on Computers
Energy awareness tree-based routing protocol for wireless sensor networks
ACACOS'11 Proceedings of the 10th WSEAS international conference on Applied computer and applied computational science
Utilizing Neighbours-Table to Improve Tree Routing Protocol in ZigBee Network
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
We study tree-based routing protocols for wireless sensor networks. The existing tree-based algorithm has a few shortcomings; (1) it may take a long path since sensor node must transmit packets via either its parent or its children nodes and (2) it is vulnerable to a link failure since the tree has to be reconstructed in case of a single link failure. We propose Plus-Tree, a routing protocol, which overcomes the shortcomings and improves the performance of the existing protocol. A node in Plus-Tree may have neighbor links other than tree links that can be used for alternative path. Simulation results show that Plus-Tree performs better than the existing tree-based protocol with respect to hop counts.