Topology management for group oriented networks

Câmara, Daniel; Bonnet, Christian; Nikaein, Navid
PIMRC 2010, 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, September 26-29, Istanbul, Turkey

This paper proposes a topology management mechanism for hierarchical group oriented networks. The key innovative aspect of this paper is to consider different interest groups in the clustering formation process. For administrative or performance reasons sometimes it is required to organize nodes, located in the same geographical area, into different groups. This
group-oriented topology management provides optimal routing for group members as well as for the last miles communication, where you only need to broadcast the message once to reach the entire interest group. Furthermore, it significantly improves the service provided to upper layers by creating a stable network topology. For example, when establishing a Public Safety Networks (PSN) to handle a disaster scenario the communication from the rescue teams may have no interest, or relation, with the communication hold by the law enforcement teams. In this case it makes sense to divide the network in two subgroups to improve routing and simplifying the medium access control. Here we propose a hierarchical network architecture to enable the organization of nodes into multiple interest groups in the same
geographical area. Through simulations, we will show that how this architecture could be adapted to different PSN requirements and what are the key parameters.


DOI
Type:
Conférence
City:
Istanbul
Date:
2010-09-26
Department:
Systèmes de Communication
Eurecom Ref:
3220
Copyright:
© 2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

PERMALINK : https://www.eurecom.fr/publication/3220