DocumentCode
2389272
Title
Efficient broadcast with forward node set in clustered mobile ad hoc networks
Author
Lou, Wei ; Wu, Jie
Author_Institution
Dept. of Comput. Sci. & Eng., Florida Atlantic Univ., Boca Raton, FL, USA
fYear
2002
fDate
14-16 Oct. 2002
Firstpage
398
Lastpage
403
Abstract
The clustered architecture of a mobile ad hoc network (MANET) has the virtue of keeping the node information locally which is suitable for scalability. Reducing broadcast redundancy can avoid the broadcast storm problem and save scarce resources such as bandwidth and energy. We propose an approach that chooses a subset of nodes, called forward node set, to relay the broadcast packet. Each clusterhead computes its forward node set that connects its adjacent clusterheads. A non-clusterhead node just relays the broadcast packet if it is selected as a forward node or else it does nothing. Therefore, the broadcast operation can be restricted only to clusterheads and nodes in locally selected forward node sets. We also utilize the information of clusterheads that are piggybacked with the broadcast packet to further reduce each forward node set. Simulation shows its performance improvement against other broadcast algorithms.
Keywords
ad hoc networks; graph theory; land mobile radio; packet radio networks; radio broadcasting; MANET; bandwidth; broadcast algorithms; broadcast packet; broadcast redundancy reduction; broadcast storm problem; clustered mobile ad hoc networks; clustered network architecture; connected graph; efficient broadcast; forward node set; network node information; performance simulation; simulation; Bandwidth; Base stations; Broadcasting; Clustering algorithms; Intelligent networks; Mobile ad hoc networks; Protocols; Relays; Scalability; Storms;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Communications and Networks, 2002. Proceedings. Eleventh International Conference on
ISSN
1095-2055
Print_ISBN
0-7803-7553-X
Type
conf
DOI
10.1109/ICCCN.2002.1043098
Filename
1043098
Link To Document