TY - GEN
T1 - MaCC
T2 - Proceedings - 18th International Conference on Advanced Information Networking and Applications, AINA 2004
AU - Takizawa, Makoto
AU - Aida, Hiroto
AU - Saito, Masato
AU - Tobe, Yoshito
AU - Tokuda, Hideyuki
N1 - Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.
PY - 2004
Y1 - 2004
N2 - This paper presents a novel effective scheme of configuring Wireless Personal Area Networks (WPANs), called Master-driven Connection Control (MaCC). WPANs are based on a new wireless technology, which enables portable and mobile computing devices, and consumer electronic appliances to communicate with each other. Assuming that WPANs operate in a master-slave style, we exploit the information about master-slave relationships for identifying a network topology in an ad hoc fashion. Specifically, MaCC supports routing, providing the minimum-hop paths that cannot be obtained by flooding algorithms. In addition, it constructs the optimal topology on demand along the minimum-hop paths dynamically, because the performance of routing is dependent on network topologies. These functions need only a few control messages to achieve, and so can avoid excessive message propagation by flooding causing frame collisions in the WPANs. MaCC has several prominent features: self-direction of every node, adaptive formation of networks, and minimization of hop counts for routing control. In this paper, we describe the details of MaCC and analyze its overhead about initialization, routing discovery, and reconfiguration. The results show control messages propagated in a MaCC network at route discovery are reduced to less than one half of those in a network utilizing pure flooding.
AB - This paper presents a novel effective scheme of configuring Wireless Personal Area Networks (WPANs), called Master-driven Connection Control (MaCC). WPANs are based on a new wireless technology, which enables portable and mobile computing devices, and consumer electronic appliances to communicate with each other. Assuming that WPANs operate in a master-slave style, we exploit the information about master-slave relationships for identifying a network topology in an ad hoc fashion. Specifically, MaCC supports routing, providing the minimum-hop paths that cannot be obtained by flooding algorithms. In addition, it constructs the optimal topology on demand along the minimum-hop paths dynamically, because the performance of routing is dependent on network topologies. These functions need only a few control messages to achieve, and so can avoid excessive message propagation by flooding causing frame collisions in the WPANs. MaCC has several prominent features: self-direction of every node, adaptive formation of networks, and minimization of hop counts for routing control. In this paper, we describe the details of MaCC and analyze its overhead about initialization, routing discovery, and reconfiguration. The results show control messages propagated in a MaCC network at route discovery are reduced to less than one half of those in a network utilizing pure flooding.
UR - http://www.scopus.com/inward/record.url?scp=3042664024&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=3042664024&partnerID=8YFLogxK
U2 - 10.1109/AINA.2004.1283893
DO - 10.1109/AINA.2004.1283893
M3 - Conference contribution
AN - SCOPUS:3042664024
SN - 0769520510
SN - 9780769520513
T3 - Proceedings - International Conference on Advanced Information Networking and Application (AINA)
SP - 90
EP - 95
BT - Proceedings - 18th International Conference on Advanced Information Networking and Applications, AINA 2004 Volume 1 (Regional Papers)
A2 - Barolli, L.
Y2 - 29 March 2004 through 31 March 2004
ER -