Abstract
The addressing-based routing solutions usually adopt a tree topology, but the routing paths along a tree are not optimal and the resources of nodes around a root are excessively consumed. Moreover, the descendants of a failed node need to rejoin a tree and reacquire addresses, and during this process they cannot perform communications. In order to overcome the above deficiencies, this paper proposes an optimal addressing-based routing scheme for 6LoWPAN. This scheme takes advantages of one-hop and two-hop neighbors to calculate optimal paths. Since a root is not involved in most of optimal paths, the excessive resource consumption is avoided. This scheme also proposes an address update algorithm and the descendants of a failed node can use this algorithm to update their addresses rather than reacquire the new addresses. During the address update process, the descendants can still use the original addresses to perform communications.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
