Building shared trees using a one-to-many joining mechanism
ACM SIGCOMM Computer Communication Review
On routes and multicast trees in the Internet
ACM SIGCOMM Computer Communication Review
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
ACM SIGMOBILE Mobile Computing and Communications Review
Independent-tree ad hoc multicast routing (ITAMAR)
Mobile Networks and Applications
Multi-level hierarchies for scalable ad hoc routing
Wireless Networks
Wireless mesh networks: a survey
Computer Networks and ISDN Systems
A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Scalable geographic routing algorithms for wireless ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Low-rate WPAN mesh network: an enabling technology for ubiquitous networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
An efficient multicast routing in IEEE 802.15.5 networks
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
SRPM: Secure Routing Protocol for IEEE 802.11 Infrastructure Based Wireless Mesh Networks
Journal of Network and Systems Management
Meshing wireless personal area networks: introducing IEEE 802.15.5
IEEE Communications Magazine
Hierarchical network protocol for large scale wireless sensor networks
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
IEEE 802.15.5 WPAN mesh standard-low rate part: meshing the wireless sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
The design and evaluation of fair scheduling in wireless mesh networks
Journal of Computer and System Sciences
Secure route selection in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.01 |
By binding logic addresses to the network topology, routing can be carried out without going through route discovery. This eliminates the initial route discovery latency, saves storage space otherwise needed for routing table, and reduces the communication overhead and energy consumption. In this paper, an adaptive block addressing (ABA) scheme is first introduced for logic address assignment as well as network auto-configuration purpose. The scheme takes into account the actual network topology and thus is fully topology-adaptive. Then a distributed link state (DLS) scheme is further proposed and put on top of the block addressing scheme to improve the quality of routes, in terms of hop count or other routing cost metrics used, robustness, and load balancing. The network topology reflected in logic addresses is used as a guideline to tell towards which direction (rather than next hop) a packet should be relayed. The next hop is derived from each relaying node's local link state table. The routing scheme, named as topology-guided DLS (TDLS) as a whole, scales well with regard to various performance metrics. The ability of TDLS to provide multiple paths also precludes the need for explicit route repair, which is the most complicated part in many wireless routing protocols. While this paper targets low rate wireless mesh personal area networks (LR-WMPANs), including wireless mesh sensor networks (WMSNs), the TDLS itself is a general scheme and can be applied to other non-mobile wireless mesh networks.