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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 11th International Conference on Computer Communications and Networks, ICCCN 2002 |
| Publisher | IEEE |
| Pages | 398-403 |
| Number of pages | 6 |
| Volume | 2002-January |
| ISBN (Electronic) | 078037553X |
| DOIs | |
| Publication status | Published - 1 Jan 2002 |
| Externally published | Yes |
| Event | 11th International Conference on Computer Communications and Networks, ICCCN 2002 - Miami, United States Duration: 14 Oct 2002 → 16 Oct 2002 |
Conference
| Conference | 11th International Conference on Computer Communications and Networks, ICCCN 2002 |
|---|---|
| Country/Territory | United States |
| City | Miami |
| Period | 14/10/02 → 16/10/02 |
Keywords
- Bandwidth
- Base stations
- Broadcasting
- Clustering algorithms
- Intelligent networks
- Mobile ad hoc networks
- Protocols
- Relays
- Scalability
- Storms
ASJC Scopus subject areas
- Computer Networks and Communications
- Hardware and Architecture
- Software