1,358 research outputs found
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
A survey of performance enhancement of transmission control protocol (TCP) in wireless ad hoc networks
This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2011 Springer OpenTransmission control protocol (TCP), which provides reliable end-to-end data delivery, performs well in traditional wired network environments, while in wireless ad hoc networks, it does not perform well. Compared to wired networks, wireless ad hoc networks have some specific characteristics such as node mobility and a shared medium. Owing to these specific characteristics of wireless ad hoc networks, TCP faces particular problems with, for example, route failure, channel contention and high bit error rates. These factors are responsible for the performance degradation of TCP in wireless ad hoc networks. The research community has produced a wide range of proposals to improve the performance of TCP in wireless ad hoc networks. This article presents a survey of these proposals (approaches). A classification of TCP improvement proposals for wireless ad hoc networks is presented, which makes it easy to compare the proposals falling under the same category. Tables which summarize the approaches for quick overview are provided. Possible directions for further improvements in this area are suggested in the conclusions. The aim of the article is to enable the reader to quickly acquire an overview of the state of TCP in wireless ad hoc networks.This study is partly funded by Kohat University of Science & Technology (KUST),
Pakistan, and the Higher Education Commission, Pakistan
Channel Allocation in An Overlaid Mesh Network
In spite of recent advancement of Wireless Mesh Technology, a lot of research challenges remained to be solved to extract the full capacity of this modern technology. As 802.11a/b/g standards make available the use of multi radio multi channel in a wireless node, a lot of research activities are going on to efficiently allocate the channel of a Mesh Network to boost its overall performances. In this research, the prospect of dividing the total network area into two non-overlapping channels of a given Mesh Network is investigated and analyzed numerically. It is found that the throughput is doubled as well as the fairness improves considerably if we deploy two channels instead of single channel backbone. An extensive simulation study has been carried out to find the optimum coverage area between two channels. The study shows that at a particular point of allocation, the network gives the optimum response.fi=Opinnäytetyö kokotekstinä PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=Lärdomsprov tillgängligt som fulltext i PDF-format
Hierarchical Cluster-Based FIFO Asynchronous Data Transfer Technique for Reducing Congestion for Energy Efficient State Wireless Sensor Network-HAEEW
The applications of WSN can be quiet numerous. In applications like battlefield monitoring, grid power generation, health systems, sensors are deployed on large scale. During such deployment, energy efficiency must be proficient, which requires clustering, in the WSN architecture. Clustering architecture requires maintenance of sensor nodes due to alfunctioning of sensor which becomes depleted of energy. As some nodes leaves and some are being replaced, congestion is introduced in the network due the limited processing capability of memory, computations, and bandwidth condition. This paper proposes one of the energy efficient clustering techniques (HAEEW), using asynchronous data transfer (ADT), which has been modeled from data transfer technique (EEHCR), and using hierarchical clustering. Our model uses synchronization in clock time queries in one and each iterations round time, to determine cluster head, and head-set member formation, using Ad hoc on-demand energy aware routing protocols (AOERP) to make decision. In each iteration, the head-set members receives message request from neighboring nodes to confirm their average distance estimation, in which to transmit aggregated data to the base station. In a sensor deployment, which is aimed for data collection, control and management of sensor nodes, play a vital role, where nodes can be adjusted to boost energy in the network life time. We used matlab for simulations analysis of our result
Energy Harvesting Wireless Communications: A Review of Recent Advances
This article summarizes recent contributions in the broad area of energy
harvesting wireless communications. In particular, we provide the current state
of the art for wireless networks composed of energy harvesting nodes, starting
from the information-theoretic performance limits to transmission scheduling
policies and resource allocation, medium access and networking issues. The
emerging related area of energy transfer for self-sustaining energy harvesting
wireless networks is considered in detail covering both energy cooperation
aspects and simultaneous energy and information transfer. Various potential
models with energy harvesting nodes at different network scales are reviewed as
well as models for energy consumption at the nodes.Comment: To appear in the IEEE Journal of Selected Areas in Communications
(Special Issue: Wireless Communications Powered by Energy Harvesting and
Wireless Energy Transfer
HWN* Mobility Management Considering QoS, Optimisation and Cross Layer Issues
In this paper, we address mobility management for 4th generation heterogeneous networks from a quality of service (QoS), optimisation and cross layer design perspective. Users are classified as high profile, normal profile and low profile according to their differentiated service requirements. Congestion avoidance control and adaptive handover mechanisms are implemented for efficient cooperation within the mobile heterogeneous network environment consisting of a TDMA network, ad hoc network and relay nodes. A previous proposed routing algorithm is also revised to include mobility management
Applications of Repeated Games in Wireless Networks: A Survey
A repeated game is an effective tool to model interactions and conflicts for
players aiming to achieve their objectives in a long-term basis. Contrary to
static noncooperative games that model an interaction among players in only one
period, in repeated games, interactions of players repeat for multiple periods;
and thus the players become aware of other players' past behaviors and their
future benefits, and will adapt their behavior accordingly. In wireless
networks, conflicts among wireless nodes can lead to selfish behaviors,
resulting in poor network performances and detrimental individual payoffs. In
this paper, we survey the applications of repeated games in different wireless
networks. The main goal is to demonstrate the use of repeated games to
encourage wireless nodes to cooperate, thereby improving network performances
and avoiding network disruption due to selfish behaviors. Furthermore, various
problems in wireless networks and variations of repeated game models together
with the corresponding solutions are discussed in this survey. Finally, we
outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference
- …