Abstract
The broadcasting protocols for transmission from peer to peer ad-hoc networks are currently a topic of enormous interest. There are several traditional algorithms which deal with the transmission of information from one source to another in the wireless ad-hoc networks. However, these conventional algorithms are not capable of eliminating the data redundancy completely. This study proposes a new technique of merging the traditional algorithms to absolutely eradicate the data redundancy problem in such networks. The customary algorithms such as the counter, distance and location based schemes only provide with a generalized methods of transmitting and reboradcasting information from one node to another but do not address the redundancy problem. The proposed method integrates the counter and location based schemes with the distance based method respectively and compares their performances to get rid of the unnecessary re-transmission of information.
Original language | English |
---|---|
Title of host publication | 14th International Conference on Computer and Information Technology, ICCIT 2011 |
Pages | 664-669 |
Number of pages | 6 |
DOIs | |
Publication status | Published - 1 Dec 2011 |
Externally published | Yes |
Event | International Conference on Computer and Information Technology 2011 - Dhaka, Bangladesh Duration: 22 Dec 2011 → 24 Dec 2011 Conference number: 14th |
Publication series
Name | 14th International Conference on Computer and Information Technology, ICCIT 2011 |
---|
Conference
Conference | International Conference on Computer and Information Technology 2011 |
---|---|
Abbreviated title | ICCIT 2011 |
Country/Territory | Bangladesh |
City | Dhaka |
Period | 22/12/11 → 24/12/11 |
Keywords
- ad-hoc networks
- algorithms
- broadcasting protocols
- rebroadcast
- redundancy