Arjan Durresi

Mieso Denko

Advances in Wireless Networks

IEEE 802.15.4, a MAC/PHY protocol for low power and low data rate wireless networks, is emerging as the popular choice for various monitoring and control applications. Depending on the application, the traffic load on an IEEE 802.15.4 network may vary over a wide range. The performance of the protocol, measured in terms of the packet loss probability and the packet latency, depends upon the prevailing traffic load among the nodes competing for channel access, the level of interference from the hidden nodes and the configuration of IEEE 802.15.4 MAC parameters. In this paper, we analyze via simulations the impact of different configurable MAC parameters on the performance of beaconless IEEE 802.15.4 networks under different traffic loads and under different levels of interference from the hidden nodes. Based on this analysis, we suggest the values of IEEE 802.15.4 MAC parameters that results in a good tradeoff between the packet loss probability and the packet latency under different conditions.

D. Rohm

M. Goyal

H. Hosseini

A. Divjak

Y. Bashir

A Simulation Based Analysis of The Impact of IEEE 802.15.4 MAC Parameters on the Performance Under Different Traffic Loads

Broadcasting is an essential and effective data propagation mechanism, with several of important applications such as route discovery, address resolution, as well as many other network services. As data broadcasting has many advantages, also causing a lot of contention, collision, and congestion, which induces what is known as &#x22;broadcast storm problems&#x22;. Broadcasting has traditionally been based on the flooding protocol, which simply overflows the network with high number of rebroadcast messages until the messages reach to all network nodes. A good probabilistic broadcasting protocol can achieve higher saved rebroadcast, low collisions and less number of relays. In this paper, we propose a dynamic probabilistic approach that dynamically fine-tunes the rebroadcasting probability according to the number of neighbour's nodes distributed in the ad hoc network for routing request packets (RREQs). The performance of the proposed approach is investigated and compared with the simple AODVand fixed probabilistic schemes using the GloMoSim network simulator under different mobility models. The performance results reveal that the improved approach is able to achieve higher saved rebroadcast and low collision as well as low number of relays than the fixed probabilistic scheme and simple AODV.

Abdalla M. Hanashi

Irfan Awan

Mike Woodward

Performance Evaluation with Different Mobility Models for Dynamic Probabilistic Flooding in MANETs

IEEE802.11DCF employs RTS/CTS (Request To Send/Clear To Send) mechanism for mitigating effect of hidden terminals. The RTS/CTS mechanism sets transmission deferral timer to neighbor terminals by exchanging RTS and CTS between transmitter and receiver. Then, in the case that RTS/CTS exchange succeeds, effect of hidden terminals could be suppressed, otherwise, any neighbor which received RTS and/or CTS defers its new transmission needlessly although DATA packet corresponding to the previous RTS/CTS exchange will not be transmitted. In this paper, we propose Cancel CTS, procedure in order to cope with the unnecessarily transmission deferment. Results of computer simulation confirms that our method well improves the throughput performance of IEEE802.11DCF.

Tetsuya Shigeyasu

Daishi Inoue

Hiroshi Matsuno

Norihiko Morinaga

A new MAC Protocol for Reducing Effect of Needless Transmission Deferment Induced by Missed RTS/CTS Handshake

In recent years, wireless technologies and application received great attention. The Medium Access Control (MAC) protocol is the main element that determines the efficiency in sharing the limited communication bandwidth of the wireless channel in wireless local area networks (WLANs). IEEE 802.11 introduced the optional RTS/CTS handshaking mechanism to address the hidden terminal problem as well as to reduces the chance of collision in case of higher node density and traffic. RTS Threshold (RT) determines when RTS/CTS mechanism should be used and proved to be an important parameter for performance characteristics in data transmission. We first investigate to find a meaningful threshold value according to the network situation and determine the impact of using or disengaging the RTS/CTS optional mechanism and dynamically adjust the RTS Threshold to maximize data transmission. The results show a significant improvement over existing CSMA/CA and RTS/CTS schemes. Our adaptive scheme performed even better when data rate increases. We verify our proposed scheme both analytically and with extensive network simulation using ns-2.

Mostafa Mjidi

Debasish Chakraborty

Naoki Nakamura

Norio Shiratori

The Impact of Dynamic RTS Threshold Adjustment for IEEE 802.11 MAC Protocol

In wireless ad hoc and sensor networks, an analysis of the node energy consumption distribution shows that the largest part is due to the time spent in the idle state. This result is at the origin of SERENA, an algorithm to SchEdule RoutEr Nodes Activity. SERENA allows router nodes to sleep, while ensuring end-to-end communication in the wireless network. It is a localized and decentralized algorithm assigning time slots to nodes. Any node stays awake only during its slot and the slots assigned to its neighbors, it sleeps the remaining time. Simulation results show that SERENA enables us to maximize network lifetime while increasing the number of user messages delivered. SERENA is based on a two-hop coloring algorithm, whose complexity in terms of colors and rounds is evaluated. We then quantify the slot reuse. Finally, we show how SERENA improves the node energy consumption distribution and maximizes the energy efficiency of wireless ad hoc and sensor networks. We compare SERENA with classical TDMA and optimized variants such as USAP in wireless ad hoc and sensor networks.

Saoucene Mahfoudh

Pascale Minet

Maximization of Energy Efficiency in Wireless ad hoc and Sensor Networks With SERENA

This paper describes an efficient method for introducing relay nodes in the given communication graph. Our algorithm assigns transmitting ranges to the nodes such that the cost of range assignment function is minimal over all connecting range assignments in the graph. The main contribution of this paper is the O(N log N) algorithm to add relay nodes to the wireless communication network and 2-approximation to assign transmitting ranges to nodes (original and relay). It does not assume that communication graph to be a unit disk graph. The output of the algorithm is the minimal Steiner tree on the graph consists of terminal (original) nodes and relay (additional) nodes. The output of approximation is the range assignments to the nodes.

Rashid Bin Muhammad

Range Assignment Problem on the Steiner Tree Based Topology in Ad Hoc Wireless Networks

About this journal

Mobile Information Systems publishes original research articles as well as review articles that report the theory and/or application of new ideas and concepts in the field of mobile information systems.

Journal profile

Meet the editorial board

Chief Editor&nbsp;Dr Alessandro Bazzi&nbsp;is based at the University of Bologna, Italy. His current research is focused on wireless technologies applied to automated and connected vehicles.

Editor spotlight

Submit your proposal

Do you think there is an emerging area of research that really needs to be highlighted? Or an existing research area that has been overlooked or would benefit from deeper investigation? Raise the profile of a research area by leading a Special Issue.

Special Issues

Author guidelines

Editorial board

Databases and indexing

title

Mobile Information Systems publishes original research articles as well as review articles that report the theory and/or application of new ideas and concepts in the field of mobile information systems.

description

https://images.hindawi.com/journals/misy/misy.banner.jpg

twitter:card

twitter:description

twitter:site

twitter:title

twitter:url

twitter:image

Mobile Information Systems | Hindawi

Mobile Information Systems

This Issue is now open for submissions.
Papers are published upon acceptance, regardless of the Special Issue publication date.

Call for papers

Published Special Issues

Mobile Information Systems

Advances in Wireless Networks

Advances in Wireless Networks

Articles