2,788 research outputs found
A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks
This paper presents a thorough survey of recent work addressing energy
efficient multicast routing protocols and secure multicast routing protocols in
Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which
witness the need of energy management and security in ad hoc wireless networks.
The objective of a multicast routing protocol for MANETs is to support the
propagation of data from a sender to all the receivers of a multicast group
while trying to use the available bandwidth efficiently in the presence of
frequent topology changes. Multicasting can improve the efficiency of the
wireless link when sending multiple copies of messages by exploiting the
inherent broadcast property of wireless transmission. Secure multicast routing
plays a significant role in MANETs. However, offering energy efficient and
secure multicast routing is a difficult and challenging task. In recent years,
various multicast routing protocols have been proposed for MANETs. These
protocols have distinguishing features and use different mechanismsComment: 15 page
Power Aware Routing for Sensor Databases
Wireless sensor networks offer the potential to span and monitor large
geographical areas inexpensively. Sensor network databases like TinyDB are the
dominant architectures to extract and manage data in such networks. Since
sensors have significant power constraints (battery life), and high
communication costs, design of energy efficient communication algorithms is of
great importance. The data flow in a sensor database is very different from
data flow in an ordinary network and poses novel challenges in designing
efficient routing algorithms. In this work we explore the problem of energy
efficient routing for various different types of database queries and show that
in general, this problem is NP-complete. We give a constant factor
approximation algorithm for one class of query, and for other queries give
heuristic algorithms. We evaluate the efficiency of the proposed algorithms by
simulation and demonstrate their near optimal performance for various network
sizes
An ant colony optimization approach for maximizing the lifetime of heterogeneous wireless sensor networks
Maximizing the lifetime of wireless sensor networks (WSNs) is a challenging problem. Although some methods exist to address the problem in homogeneous WSNs, research on this problem in heterogeneous WSNs have progressed at a slow pace. Inspired by the promising performance of ant colony optimization (ACO) to solve combinatorial problems, this paper proposes an ACO-based approach that can maximize the lifetime of heterogeneous WSNs. The methodology is based on finding the maximum number of disjoint connected covers that satisfy both sensing coverage and network connectivity. A construction graph is designed with each vertex denoting the assignment of a device in a subset. Based on pheromone and heuristic information, the ants seek an optimal path on the construction graph to maximize the number of connected covers. The pheromone serves as a metaphor for the search experiences in building connected covers. The heuristic information is used to reflect the desirability of device assignments. A local search procedure is designed to further improve the search efficiency. The proposed approach has been applied to a variety of heterogeneous WSNs. The results show that the approach is effective and efficient in finding high-quality solutions for maximizing the lifetime of heterogeneous WSNs
Cross-layer Balanced and Reliable Opportunistic Routing Algorithm for Mobile Ad Hoc Networks
For improving the efficiency and the reliability of the opportunistic routing
algorithm, in this paper, we propose the cross-layer and reliable opportunistic
routing algorithm (CBRT) for Mobile Ad Hoc Networks, which introduces the
improved efficiency fuzzy logic and humoral regulation inspired topology
control into the opportunistic routing algorithm. In CBRT, the inputs of the
fuzzy logic system are the relative variance (rv) of the metrics rather than
the values of the metrics, which reduces the number of fuzzy rules
dramatically. Moreover, the number of fuzzy rules does not increase when the
number of inputs increases. For reducing the control cost, in CBRT, the node
degree in the candidate relays set is a range rather than a constant number.
The nodes are divided into different categories based on their node degree in
the candidate relays set. The nodes adjust their transmission range based on
which categories that they belong to. Additionally, for investigating the
effection of the node mobility on routing performance, we propose a link
lifetime prediction algorithm which takes both the moving speed and moving
direction into account. In CBRT, the source node determines the relaying
priorities of the relaying nodes based on their utilities. The relaying node
which the utility is large will have high priority to relay the data packet. By
these innovations, the network performance in CBRT is much better than that in
ExOR, however, the computation complexity is not increased in CBRT.Comment: 14 pages, 17 figures, 31 formulas, IEEE Sensors Journal, 201
Flow Allocation for Maximum Throughput and Bounded Delay on Multiple Disjoint Paths for Random Access Wireless Multihop Networks
In this paper, we consider random access, wireless, multi-hop networks, with
multi-packet reception capabilities, where multiple flows are forwarded to the
gateways through node disjoint paths. We explore the issue of allocating flow
on multiple paths, exhibiting both intra- and inter-path interference, in order
to maximize average aggregate flow throughput (AAT) and also provide bounded
packet delay. A distributed flow allocation scheme is proposed where allocation
of flow on paths is formulated as an optimization problem. Through an
illustrative topology it is shown that the corresponding problem is non-convex.
Furthermore, a simple, but accurate model is employed for the average aggregate
throughput achieved by all flows, that captures both intra- and inter-path
interference through the SINR model. The proposed scheme is evaluated through
Ns2 simulations of several random wireless scenarios. Simulation results reveal
that, the model employed, accurately captures the AAT observed in the simulated
scenarios, even when the assumption of saturated queues is removed. Simulation
results also show that the proposed scheme achieves significantly higher AAT,
for the vast majority of the wireless scenarios explored, than the following
flow allocation schemes: one that assigns flows on paths on a round-robin
fashion, one that optimally utilizes the best path only, and another one that
assigns the maximum possible flow on each path. Finally, a variant of the
proposed scheme is explored, where interference for each link is approximated
by considering its dominant interfering nodes only.Comment: IEEE Transactions on Vehicular Technolog
- …