Efficient Local Broadcast Algorithms in Wireless Ad Hoc Networks using Static and Dynamic Approaches
نویسندگان
چکیده
One of the fundamental operations in wireless ad hoc networks is broadcasting. To successfully reducing the number of transmissions of broadcast that are required to achieve full delivery with energy consumption using local broadcast algorithm. This broadcast algorithm is proposed for guarantee with full delivery and successful approximation to the optimum solution without considering the node position. There are two main approaches, static and dynamic, to broadcast algorithms in wireless ad hoc networks. Using the local topology information, the local algorithm determines the status of each node and also the priority function. In this paper the static approach in local broadcast algorithm is explained first. Using this approach it is not possible to achieve the good approximation factor to the optimum solution. If the position information is available, the constant approximation factor is got. But in dynamic approach the position of the node is determined "on-the-fly" based on local topology information. So, it is possible to get the good approximation factor to the optimum solution in dynamic approach of local broadcast algorithm. The position information is the solution for getting good approximation factor. But in some applications it may not be possible to get position information. Therefore, it is need to know whether local broadcast algorithms can achieve a constant approximation factor without using position information based on dynamic approach. To simplifying this problem, a local broadcast is designed in which the status of each node is
منابع مشابه
Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملIntuitionistic fuzzy logic for adaptive energy efficient routing in mobile ad-hoc networks
In recent years, mobile ad-hoc networks have been used widely due to advances in wireless technology. These networks are formed in any environment that is needed without a fixed infrastructure or centralized management. Mobile ad-hoc networks have some characteristics and advantages such as wireless medium access, multi-hop routing, low cost development, dynamic topology and etc. In these netwo...
متن کاملBeeID: intrusion detection in AODV-based MANETs using artificial Bee colony and negative selection algorithms
Mobile ad hoc networks (MANETs) are multi-hop wireless networks of mobile nodes constructed dynamically without the use of any fixed network infrastructure. Due to inherent characteristics of these networks, malicious nodes can easily disrupt the routing process. A traditional approach to detect such malicious network activities is to build a profile of the normal network traffic, and then iden...
متن کاملResults and Performance Analysis of Local Broadcast Algorithms in Wireless Ad hoc Networks: Reducing the Number of Transmissions
Among Many fundamental communication primitives in wireless ad hoc network, flooding in wireless ad hoc network reduces the number of transmission in network and it plays a significant role in which every node transmits the message after receiving it for the first time. To successfully reducing the number of transmissions of broadcast that are required to achieve full delivery and constant appr...
متن کاملEfficient Broadcast Algorithms To Reduce number of transmission Based on Probability Scheme
Two main approaches to broadcast packets in wireless ad hoc networks are static and dynamic. In the static approach, algorithms determine the status (forwarding/nonforwarding) of each node proactively based on local topology information and a globally known priority function. In the dynamic approach, local algorithms determine the status of each node based on local topology information and broa...
متن کامل