The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Selfish behavior at the MAC (medium access control) layer can have devastating side effects on the performance of wireless ad hoc networks. In this work, we consider the problem of detecting selfish behavior at the MAC layer in IEEE 802.11 wireless networks when a selfish node can manipulate the backoff operation. We propose a simple and robust mechanism based on CUSUM (cumulative sum) test by tracing...
Research on the effect of selfish node in wireless ad hoc networks has received considerable attention recently. However, most work concentrates on simulation study, but lacks an analytical study to accurately predict the throughput. This paper investigates the saturated and non-saturated load throughputs of IEEE 802.11 DCF (distributed coordinated function) in the presence of a selfish node. Using...
In wireless ad hoc networks, fair allocation of bandwidth among different TCP flows is one of the critical problems that affect the performance of the entire system. This paper proposes a fairness mechanism - Adaptive_Pause. Adaptive_Pause is a simple and distributed scheme that only needs little communication and processing overhead. Each node monitors the occupation of the channel due to its emissions...
To provide reliable transmission in wireless ad hoc networks, two problems need to be solved. The first one is to find reliable routes for packets transmission. And the second one is to re-route packets as soon as possible when route failures occur. Aiming at solving these two problems, this paper proposes a reliable routing algorithm called QDSR by making two improvements to DSR. Integrating ETX...
Energy conservation is a critical issue in wireless ad hoc networks, as usually nodes are powered by batteries only. This paper proposes a cross-layer design of energy-aware multicast ad hoc on-demand distance vector (CEMAODV) routing protocol. At one hand it adopts cross-layer mechanism and energy-aware metric to modify AODV routing protocol to reduce the energy consumption of the route to construct...
This paper describes a type of selfish node behavior in the MAC layer and studies its effects on the performance of ad hoc networks. We use a game-theoretic approach to investigate the selfish behavior problem by focusing on the strategy that a node can adopt during wireless channel access. Based on this investigation, we obtained the guidelines to design a mechanism that can force the selfish node...
In wireless ad hoc networks, bandwidth reservation has been a de facto method to achieve a certain quality of service (QoS). When a node reserves bandwidth for a QoS flow, corresponding bandwidth reservation will also be done at all its neighboring nodes simultaneously to eliminate the negative impact on bandwidth reservation caused by channel contention. This paper extends the QoS neighborhood reservation...
Video transport over wireless ad hoc networks poses a great challenge due to the high variability of the network bandwidth. In this paper, to improve the quality of receipt video, we proposed a cross-layer adaptive rate control mechanism, CLARC, which makes good use of both the routing information from the underlying network layer, and the frame loss feeding back from the application layer. The scheme...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.