期刊名称:International Journal of Computer Applications and Information Technology
印刷版ISSN:2278-7720
出版年度:2012
卷号:1
期号:3
页码:21-25
出版社:Mahadev Educational Society
摘要:In Mobile Ad-hoc Network (MANETs) one of the most basic fundamental operations is broadcasting. Broadcasting is operated with flooding which leads to the problem such as transmission redundancy and packet collision. This requires a lot of energy resource of the node. The flooding algorithm provokes a more number of unnecessary packet rebroadcasts, wasting allocated bandwidth, causing contention and packet collision. There are some efficient flooding algorithms existing to tackle the redundancy problem. The earlier proposed algorithms require either maintaining 2-hop neighbor information or have to select subset of nodes. In this project, the algorithm proposed is used at the receiver end. Each node, receiving a broadcast packet, will broadcast the cut message along with the packet identity and the path information to all other connected nodes. Unlike the most existing techniques, each node tracks the neighboring nodes information from which redundant messages are received. This proposed algorithm achieves local optimality by breaking the cycles between them. When each the node receives the packet, the cut messages are broadcasted to minimize the cycle redundancy. The receiver node is involved in the process of decision making and so the decision is taken by the receiver node. The proposed system would be capable of easily included with the existing system as the decision is to be taken by the receiver node. The proposed system is an improved version of the existing algorithm, which is more graceful in interpreting existing protocols.
关键词:Wireless ad hoc networks; flooding; broadcasting; ; transmission redundancy