Do you want to publish a course? Click here

Constructing Path Efficient and Energy Aware Virtual Multicast Backbones in Static Ad Hoc Wireless Networks

146   0   0.0 ( 0 )
 Publication date 2010
and research's language is English




Ask ChatGPT about the research

For stationary wireless ad hoc networks, one of the key challenging issues in routing and multicasting is to conserve as much energy as possible without compromising path efficiency measured as end-to-end delay. In this paper, we address the problem of path efficient and energy aware multicasting in static wireless ad hoc networks. We propose a novel distributed scalable algorithm for finding a virtual multicast backbone (VMB). Based on this VMB, we have further developed a multicasting scheme that jointly improves path efficiency and energy conservation. By exploiting inherent broadcast advantage of wireless communication and employing a more realistic energy consumption model for wireless communication which not only depends on radio propagation losses but also on energy losses in transceiver circuitry, our simulation results show that the proposed VMB-based multicasting scheme outperforms existing prominent tree based energy conserving, path efficient multicasting schemes.



rate research

Read More

Ad hoc network is a collection of different types of nodes, which are connected in heterogeneous or homogeneous manner. It is also known as self-organizing-wireless network. The dynamic nature of ad hoc networks make them more attractive, which is used in many different applications. Every coin has two sides: one is the advantage part and other is disadvantages, in the same manner nature of ad hoc network make it more attractive from one side in other hand there are some issues too. Energy efficiency is a core factor which effects on ad hoc network in terms of battery life, throughput, overhead of messages, transmission error. For solving issues of energy constraints, different mechanisms are proposed by various researchers. In this paper, we survey various existing schemes which attempt to improve energy efficiency of different types of ad hoc routing protocol to increase network lifetime. Furthermore we outline future scope of these existing schemes which may help researches to carry out further research in this direction.
We study a wireless ad-hoc sensor network (WASN) where $N$ sensors gather data from the surrounding environment and transmit their sensed information to $M$ fusion centers (FCs) via multi-hop wireless communications. This node deployment problem is formulated as an optimization problem to make a trade-off between the sensing uncertainty and energy consumption of the network. Our primary goal is to find an optimal deployment of sensors and FCs to minimize a Lagrange combination of the sensing uncertainty and energy consumption. To support arbitrary routing protocols in WASNs, the routing-dependent necessary conditions for the optimal deployment are explored. Based on these necessary conditions, we propose a routing-aware Lloyd algorithm to optimize node deployment. Simulation results show that, on average, the proposed algorithm outperforms the existing deployment algorithms.
148 - A. Sabari , K. Duraiswamy , 2009
Multicasting is effective when its group members are sparse and the speed is low. On the other hand, broadcasting is effective when the group members dense and the speed are high. Since mobile ad hoc networks are highly dynamic in nature, either of the above two strategies can be adopted at different scenarios. In this paper, we propose an ant agent based adaptive, multicast protocol that exploits group members desire to simplify multicast routing and invoke broadcast operations in appropriate localized regimes. By reducing the number of group members that participate in the construction of the multicast structure and by providing robustness to mobility by performing broadcasts in densely clustered local regions, the proposed protocol achieves packet delivery statistics that are comparable to that with a pure multicast protocol but with significantly lower overheads. By our simulation results, we show that our proposed protocol achieves increased Packet Delivery Fraction (PDF) with reduced overhead and routing load.
In this paper, the well-known forwarders dilemma is generalized by accounting for the presence of link quality fluctuations; the forwarders dilemma is a four-node interaction model with two source nodes and two destination nodes. It is known to be very useful to study ad hoc networks. To characterize the long-term utility region when the source nodes have to control their power with partial channel state information (CSI), we resort to a recent result in Shannon theory. It is shown how to exploit this theoretical result to find the long-term utility region and determine good power control policies. This region is of prime importance since it provides the best performance possible for a given knowledge at the nodes. Numerical results provide several new insights into the repeated forwarders dilemma power control problem; for instance, the knowledge of global CSI only brings a marginal performance improvement with respect to the local CSI case.
Topology Control (TC) aims at tuning the topology of highly dynamic networks to provide better control over network resources and to increase the efficiency of communication. Recently, many TC protocols have been proposed. The protocols are designed for preserving connectivity, minimizing energy consumption, maximizing the overall network coverage or network capacity. Each TC protocol makes different assumptions about the network topology, environment detection resources, and control capacities. This circumstance makes it extremely difficult to comprehend the role and purpose of each protocol. To tackle this situation, a taxonomy for TC protocols is presented throughout this paper. Additionally, some TC protocols are classified based upon this taxonomy.
comments
Fetching comments Fetching comments
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا