Awaking guarantee in mobile wireless networks for mobile nodes based on stochastic mobility mode
Date
2020
Authors
Totona, Bruce Lonyeiye
Journal Title
Journal ISSN
Volume Title
Publisher
Strathmore University
Abstract
The mobile wireless network is one of the areas in mobile computing getting more attention due to a plethora of innovations around the subject. The innovations and applications range from wireless sensor networks (Low-Rate Wireless Personal Area Network (LR-WPANs)), embedded systems and robotics. However, the technology provides some challenges in terms of mobile nodes awakening (active connection and synchronization) and services guarantee because the networks are highly dynamic. This research studied how to improve service provisions in mobile wireless networks and particularly in the wireless sensor networks using ZigBee modules by integrating synchronization and the routing procedure in the network. Ad-hoc On-demand Distance Vector (AODV) which is a common routing algorithm in wireless mobile networks was combined with the synchronization algorithm- non-beacon-enabled CSMA-based IEEE 802.15.4 MAC to overcome the challenge of hidden mobile nodes which are most often the new nodes joining the network. The beacon interval (Bi), the superframe duration (Sd), and the beacon time offset (Bto) were the key integration parameters and comes after active scanning. Random Waypoint (RWP) mobility model on Matlab was used to evaluate the mobility of the nodes considering their speeds, direction, and position from the coordinator. Elliptic Curve Digital Signature Algorithm (ECDSA) and the Advanced Encryption Standard (AES) algorithms were used to secure the modules and the channels.
Description
A Thesis Submitted to the Faculty of Information Technology as a partial requirement for the award of a Master degree in Information Technology
Keywords
Algorithm, Dynamic network, Low-level services, Mobility, Robustness, Synchronization, ZigBee, Beacons, Connectedness, Routing