• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6A
• /
• pp.583-588
• /
• 2004

For the Explicit Multicast (Xcast) scheme, we propose a scheme that provides dynamic group membership and supports a large, dense multicast group. To do so, we use a hierarchical joining mechanism, where a domain agent joins a group on behalf of hosts. In our scheme, a sender transmits multicast packets to a domain agent, and then the agent forwards the packets to receivers in a domain. A host can join or leave a group at my time via the domain agent. Thus, a destination field of the Xcast header has addresses of domain agents instead of hosts. Simulation results show that our scheme can reduce more the Xcast header size and cost in forwarding packets than the Xcast, especially for a large multicast group. Like traditional multicast schemes, our scheme can support large multicast group members.

• Journal of Communications and Networks
• /
• v.11 no.3
• /
• pp.248-260
• /
• 2009

To connect a mobile ad hoc network (MANET) with an IP network and to carryout communication, ad hoc network node needs to be configured with unique IP adress. Dynamic host configuration protocol (DHCP) server autoconfigure nodes in wired networks. However, this cannot be applied to ad hoc network without introducing some changes in auto configuration mechanism, due to intrinsic properties (i.e., multi-hop, dynamic, and distributed nature) of the network. In this paper, we propose a scalable autoconfiguration scheme for MANETs with hierarchical topology consisting of leader and member nodes, by considering the global Internet connectivity with minimum overhead. In our proposed scheme, a joining node selects one of the pre-configured nodes for its duplicate address detection (DAD) operation. We reduce overhead and make our scheme scalable by eliminating the broadcast of DAD messages in the network. We also propose the group leader election algorithm, which takes into account the resources, density, and position information of a node to select a new leader. Our simulation results show that our proposed scheme is effective to reduce the overhead and is scalable. Also, it is shown that the proposed scheme provides an efficient method to heal the network after partitioning and merging by enhancing the role of bordering nodes in the group.