82 research outputs found
Review - Improve Performance of Efficient Aggregation Scheduling In Multihop Wireless Sensor Network
The aggregated scheduling of data in networks of wireless sensors with interference of signal with SINR limitations is studied. A routing tree is formulated hat provides an overview of scheduling algorithms by which schemas of interlinking that are free of collision for clustering of data. The latency of algorithm that is suggested is improvised of IAS & DAS. The delay counted n every algorithm is O(R + ?) in time-slots, where ? & R are radius of graph & the extreme degree of node in a minimized graph communication of the real network, are optimized in sensors which are wireless. It is observed that throughput of algorithms suggested in enhanced than that of CIAS & CDAS
On Energy Efficient Hierarchical Cross-Layer Design: Joint Power Control and Routing for Ad Hoc Networks
In this paper, a hierarchical cross-layer design approach is proposed to
increase energy efficiency in ad hoc networks through joint adaptation of
nodes' transmitting powers and route selection. The design maintains the
advantages of the classic OSI model, while accounting for the cross-coupling
between layers, through information sharing. The proposed joint power control
and routing algorithm is shown to increase significantly the overall energy
efficiency of the network, at the expense of a moderate increase in complexity.
Performance enhancement of the joint design using multiuser detection is also
investigated, and it is shown that the use of multiuser detection can increase
the capacity of the ad hoc network significantly for a given level of energy
consumption.Comment: To appear in the EURASIP Journal on Wireless Communications and
Networking, Special Issue on Wireless Mobile Ad Hoc Network
Multiflow Transmission in Delay Constrained Cooperative Wireless Networks
This paper considers the problem of energy-efficient transmission in
multi-flow multihop cooperative wireless networks. Although the performance
gains of cooperative approaches are well known, the combinatorial nature of
these schemes makes it difficult to design efficient polynomial-time algorithms
for joint routing, scheduling and power control. This becomes more so when
there is more than one flow in the network. It has been conjectured by many
authors, in the literature, that the multiflow problem in cooperative networks
is an NP-hard problem. In this paper, we formulate the problem, as a
combinatorial optimization problem, for a general setting of -flows, and
formally prove that the problem is not only NP-hard but it is
inapproxmiable. To our knowledge*, these results provide
the first such inapproxmiablity proof in the context of multiflow cooperative
wireless networks. We further prove that for a special case of k = 1 the
solution is a simple path, and devise a polynomial time algorithm for jointly
optimizing routing, scheduling and power control. We then use this algorithm to
establish analytical upper and lower bounds for the optimal performance for the
general case of flows. Furthermore, we propose a polynomial time heuristic
for calculating the solution for the general case and evaluate the performance
of this heuristic under different channel conditions and against the analytical
upper and lower bounds.Comment: 9 pages, 5 figure
Cross layer design for service differentiation in mobile ad hoc networks
Cross layer design is a promising approach in mobile ad hoc networks (MANET) to combat the fast time-varying characteristics of wireless links, network topology, and application traffic. In this paper, we employ cross layer design to develop a novel scheduling scheme with two optimizations aimed at service differentiation. The scheduling scheme is executed at the network layer of every station according to the channel conditions estimated by the MAC layer. The optimizations are based on traffic property sharing and packet timeout period interaction to reduce the packet collisions and improve network performance. We evaluate the proposed scheme under different network loads in terms of packet delivery ratio, average end-to-end delay and delay jitter. The simulation results show that our scheme can provide different service differentiations for time-bounded and best effort traffics. In particular, we can guarantee the delay and delay jitter requirements of time-bounded traffic. © 2003 IEEE.published_or_final_versio
Multi-Channel Scheduling for Fast Convergecast in Wireless Sensor Networks
We explore the following fundamental question -
how fast can information be collected from a wireless sensor
network? We consider a number of design parameters such
as, power control, time and frequency scheduling, and routing.
There are essentially two factors that hinder efficient data
collection - interference and the half-duplex single-transceiver
radios. We show that while power control helps in reducing the
number of transmission slots to complete a convergecast under a
single frequency channel, scheduling transmissions on different
frequency channels is more efficient in mitigating the effects of
interference (empirically, 6 channels suffice for most 100-node
networks). With these observations, we define a receiver-based
channel assignment problem, and prove it to be NP-complete on
general graphs. We then introduce a greedy channel assignment
algorithm that efficiently eliminates interference, and compare
its performance with other existing schemes via simulations.
Once the interference is completely eliminated, we show that
with half-duplex single-transceiver radios the achievable schedule
length is lower-bounded by max(2nk − 1,N), where nk is the
maximum number of nodes on any subtree and N is the number
of nodes in the network. We modify an existing distributed time
slot assignment algorithm to achieve this bound when a suitable
balanced routing scheme is employed. Through extensive simulations,
we demonstrate that convergecast can be completed within
up to 50% less time slots, in 100-node networks, using multiple
channels as compared to that with single-channel communication.
Finally, we also demonstrate further improvements that are
possible when the sink is equipped with multiple transceivers
or when there are multiple sinks to collect data
- …