12,307 research outputs found
A Comprehensive Survey of Potential Game Approaches to Wireless Networks
Potential games form a class of non-cooperative games where unilateral
improvement dynamics are guaranteed to converge in many practical cases. The
potential game approach has been applied to a wide range of wireless network
problems, particularly to a variety of channel assignment problems. In this
paper, the properties of potential games are introduced, and games in wireless
networks that have been proven to be potential games are comprehensively
discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on
Communications, vol. E98-B, no. 9, Sept. 201
Dynamic Voltage Scaling Techniques for Energy Efficient Synchronized Sensor Network Design
Building energy-efficient systems is one of the principal challenges in wireless sensor networks. Dynamic voltage scaling (DVS), a technique to reduce energy consumption by varying the CPU frequency on the fly, has been widely used in other settings to accomplish this goal. In this paper, we show that changing the CPU frequency can affect timekeeping functionality of some sensor platforms. This phenomenon can cause an unacceptable loss of time synchronization in networks that require tight synchrony over extended periods, thus preventing all existing DVS techniques from being applied. We present a method for reducing energy consumption in sensor networks via DVS, while minimizing the impact of CPU frequency switching on time synchronization.
The system is implemented and evaluated on a network of 11 Imote2 sensors mounted on a truss bridge and running a high-fidelity continuous structural health monitoring
application. Experimental measurements confirm that the algorithm significantly reduces network energy consumption
over the same network that does not use DVS, while requiring significantly fewer re-synchronization actions than a classic DVS algorithm.unpublishedis peer reviewe
Optimal channel allocation with dynamic power control in cellular networks
Techniques for channel allocation in cellular networks have been an area of
intense research interest for many years. An efficient channel allocation
scheme can significantly reduce call-blocking and calldropping probabilities.
Another important issue is to effectively manage the power requirements for
communication. An efficient power control strategy leads to reduced power
consumption and improved signal quality. In this paper, we present a novel
integer linear program (ILP) formulation that jointly optimizes channel
allocation and power control for incoming calls, based on the
carrier-to-interference ratio (CIR). In our approach we use a hybrid channel
assignment scheme, where an incoming call is admitted only if a suitable
channel is found such that the CIR of all ongoing calls on that channel, as
well as that of the new call, will be above a specified value. Our formulation
also guarantees that the overall power requirement for the selected channel
will be minimized as much as possible and that no ongoing calls will be dropped
as a result of admitting the new call. We have run simulations on a benchmark
49 cell environment with 70 channels to investigate the effect of different
parameters such as the desired CIR. The results indicate that our approach
leads to significant improvements over existing techniques.Comment: 11 page
Towards Optimal Distributed Node Scheduling in a Multihop Wireless Network through Local Voting
In a multihop wireless network, it is crucial but challenging to schedule
transmissions in an efficient and fair manner. In this paper, a novel
distributed node scheduling algorithm, called Local Voting, is proposed. This
algorithm tries to semi-equalize the load (defined as the ratio of the queue
length over the number of allocated slots) through slot reallocation based on
local information exchange. The algorithm stems from the finding that the
shortest delivery time or delay is obtained when the load is semi-equalized
throughout the network. In addition, we prove that, with Local Voting, the
network system converges asymptotically towards the optimal scheduling.
Moreover, through extensive simulations, the performance of Local Voting is
further investigated in comparison with several representative scheduling
algorithms from the literature. Simulation results show that the proposed
algorithm achieves better performance than the other distributed algorithms in
terms of average delay, maximum delay, and fairness. Despite being distributed,
the performance of Local Voting is also found to be very close to a centralized
algorithm that is deemed to have the optimal performance
An Analytical Model for Wireless Mesh Networks with Collision-Free TDMA and Finite Queues
Wireless mesh networks are a promising technology for connecting sensors and
actuators with high flexibility and low investment costs. In industrial
applications, however, reliability is essential. Therefore, two time-slotted
medium access methods, DSME and TSCH, were added to the IEEE 802.15.4 standard.
They allow collision-free communication in multi-hop networks and provide
channel hopping for mitigating external interferences. The slot schedule used
in these networks is of high importance for the network performance. This paper
supports the development of efficient schedules by providing an analytical
model for the assessment of such schedules, focused on TSCH. A Markov chain
model for the finite queue on every node is introduced that takes the slot
distribution into account. The models of all nodes are interconnected to
calculate network metrics such as packet delivery ratio, end-to-end delay and
throughput. An evaluation compares the model with a simulation of the Orchestra
schedule. The model is applied to Orchestra as well as to two simple
distributed scheduling algorithms to demonstrate the importance of
traffic-awareness for achieving high throughput.Comment: 17 pages, 14 figure
- …