Enabling limited traffic scheduling in asynchronous ad hoc networks

We present work-in-progress developing a communication framework that addresses the communication challenges of the decentralized multihop wireless environment. The main contribution is the combination of a fully distributed, asynchronous power save mechanism with adaptation of the timing patterns defined by the power save mechanism to improve the energy and bandwidth efficiency of communication in multihop wireless networks. The possibility of leveraging this strategy to provide more complex forms of traffic management is explored

Distributed QoS Guarantees for Realtime Traffic in Ad Hoc Networks

In this paper, we propose a new cross-layer framework, named QPART ( QoS br>rotocol for Adhoc Realtime Traffic), which provides QoS guarantees to real-time multimedia applications for wireless ad hoc networks. By adapting the contention window sizes at the MAC layer, QPART schedules packets of flows according to their unique QoS requirements. QPART implements priority-based admission control and conflict resolution to ensure that the requirements of admitted realtime flows is smaller than the network capacity. The novelty of QPART is that it is robust to mobility and variances in channel capacity and imposes no control message overhead on the network

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

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

Deploying rural community wireless mesh networks

Inadequate Internet access is widening the digital divide between town and countryside, degrading both social communication and business advancements in rural areas. Wireless mesh networking can provide an excellent framework for delivering broadband services to such areas. With this in mind, Lancaster University deployed a WMN in the rural village of Wray over a three-year period, providing the community with Internet service that exceeds many urban offerings. The project gave researchers a real-world testbed for exploring the technical and social issues entailed in deploying WMNs in the heart of a small community

A Review of Interference Reduction in Wireless Networks Using Graph Coloring Methods

The interference imposes a significant negative impact on the performance of wireless networks. With the continuous deployment of larger and more sophisticated wireless networks, reducing interference in such networks is quickly being focused upon as a problem in today's world. In this paper we analyze the interference reduction problem from a graph theoretical viewpoint. A graph coloring methods are exploited to model the interference reduction problem. However, additional constraints to graph coloring scenarios that account for various networking conditions result in additional complexity to standard graph coloring. This paper reviews a variety of algorithmic solutions for specific network topologies.Comment: 10 pages, 5 figure

Wireless measurement Scheme for bandwidth Estimation in Multihop Wireless Adhoc network

The necessity to bear real time and multimedia application for users of Mobile 1D468;1D485;1D489;1D490;1D484; Network (1D474;1D468;1D475;1D46C;1D47B;) is becoming vital. Mobile 1D468;1D485;1D489;1D490;1D484; network facilitates decentralized network that can present multimedia users with mobility that they have demanded, if proficient 1D478;1D490;1D47A; multicast strategies were developed. By giving the guarantee of 1D478;1D490;1D47A; in 1D468;1D485;1D489;1D490;1D484; network, the proficient bandwidth estimation method plays a very important role. The research paper represented here presents a splendid method for estimating or measuring Bandwidth in 1D468;1D485;1D489;1D490;1D484; network whose character is decentralized in nature. Contrasting in the centralized formation, the bandwidth estimating in 1D468;1D485;1D489;1D490;1D484; is significant and this eventually makes an influence over the 1D478;1D490;1D47A; of the network communication. The admission control and dynamic bandwidth management method which is presented here, facilitates it with fairness and rate guarantees despite the distributed link layer fair scheduling being absent. Alteration has been made over 1D474;1D468;1D46A; layer and this method is appropriate where the peer-to-peer (1D477;1D7D0;1D477;) multimedia transmissions rates are amended in compliantly fashion.In the research work presented here the architecture of the 1D474;1D468;1D46A; layer has been altered and the data handling capacity has been increased. This technique is adopted to facilitate higher data rate transmission and eliminate congestion over the considerednetwork. The proposed technique implements the splitting of 1D474;1D468;1D46A; into two sub layer where one will be responsible for control data transmission while other effectively transmits the data bits. Thus it results into higher data rate transmission with better accuracy and optimized network throughput. The research work in the presented paper exhibits superior accuracy and is very much effective in bandwidth estimation and management application in multi hop Mobile Ad-H

Multihop clustering algorithm for load balancing in wireless sensor networks

The paper presents a new cluster based routing algorithm that exploits the redundancy properties of the sensor networks in order to address the traditional problem of load balancing and energy efficiency in the WSNs.The algorithm makes use of the nodes in a sensor network of which area coverage is covered by the neighbours of the nodes and mark them as temporary cluster heads. The algorithm then forms two layers of multi hop communication. The bottom layer which involves intra cluster communication and the top layer which involves inter cluster communication involving the temporary cluster heads. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing and is also more efficient in terms of energy consumption from Leach and the enhanced version of Leach