Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    Fitness Sorted Red Deer-Cat Swarm Optimization-based Autonomous QoS-aware Multicast Communication System in MANET

    A mobile ad hoc network (MANET) is a set of autonomous mobile devices connected by wireless links in a distributed manner and without a fixed infrastructure. Mobile Ad-Hoc Networks (MANETs) is considered as an infrastructure-less and constant self-configured network of wireless devices. Here, multicast has emerged as an efficient tool for communication. Recently, distinct research works have been studied in wireless MANETs for designing multicast routing protocols. Multicasting is a procedure used for allowing the users to send the same messages simultaneously to a set of users. Though, it suffers from different problems regarding implementation in ad-hoc networks owing to its shorter battery lifetime, and lack of bandwidth dynamic nature of the mobile devices. Hence, the main aim of this paper is to propose a new QoS-aware multi-cast routing protocol in MANET using the hybrid meta-heuristic algorithm. The proposed routing protocol will focus on the development of a hybrid meta-heuristic-based “reliable neighbor nodes selection” scheme over the Multicast Ad-Hoc on Demand Distance Vector routing protocol (MAODV) protocol. The “reliable neighbor nodes selection” is accomplished by Fitness sorted Red Deer-Cat Swarm Optimization (FRD-CSO) algorithm focusing on the constraints like energy model, mobility model, and reliability pair factor. Once the optimal node selection is performed, the proposed QoS-aware protocol is validated by the route discovery mechanism and route reply process. The simulation has been performed to show the efficiency of the designed multicast routing over other multicast routing protocols that demonstrates the noteworthy enhancement in terms of diverse performance measures.

  • articleNo Access

    MODELING AND OPTIMIZATION OF ZONE-BASED REGISTRATION FOR MOBILE COMMUNICATION NETWORK

    An efficient mobility management for mobile stations plays an important role in mobile communication networks. Two basic operations of mobility management are location registration and paging. A zone-based registration (ZBR) is implemented in most of the mobile communication networks and we consider the mobility management scheme that combines a zone-based registration and a selective paging (SP). We propose a new analytical model that can reflect the characteristics of the ZBR smoothly where location areas of the ZBR are set up so that regions such as roads, bridges, rivers and mountains, where there is relatively little traffic, will constitute their boundaries. We adopt a revised 2-dimensional random walk mobility model to consider such characteristics. In addition, we propose a more efficient division scheme of location area for 2-step selective paging. We evaluate the performance of the mobility management scheme using our mobility model to determine the optimal size of a location area that will result in the minimum signaling traffic on radio channels. Numerical results are provided to demonstrate that our mobility model is useful to evaluate the ZBR more exactly. The results of this study can be used effectively in analyzing and comparing the performances of various mobility management schemes.

  • articleNo Access

    Localization–compensation algorithm based on the Mean kShift and the Kalman filter

    In this paper, we propose a localization simulator based on the random walk/waypoint mobility model and a hybrid-type location–compensation algorithm using the Mean kShift/Kalman filter (MSKF) to enhance the precision of the estimated location value of mobile modules. From an analysis of our experimental results, the proposed algorithm using the MSKF can better compensate for the error rates, the average error rate per estimated distance moved by the mobile node (Err_ RateDV) and the error rate per estimated trace value of the mobile node (Err_RateTV) than the Mean shift or Kalman filter up to a maximum of 29% in a random mobility environment for the three scenarios.

  • articleNo Access

    MODELING THE GROUP MOBILITY PATTERN IN WIRELESS BODY SENSOR NETWORKS

    Wireless network of wearable biomedical sensors by human body shows great potential to enhance the biometrics performance significantly. Meanwhile, it poses prominent characteristics and challenges to physicians and engineers for its particular medical application as compared to other application of wireless sensor networks (WSN). Mobility pattern plays an important role in designing the wireless body sensor networks (WBSN) and will also affect the accuracy of modeling WBSN in health care application. Much of the mobility scenarios generated in current work of wireless body sensor networks has used fairly simple models to generate the mobile topological graph, which bear little resemblance to the actual mobility patterns. This paper is the first attempt to investigate the mobility model in WBSN based on the existing mobility models in wireless data networks and ad hoc networks. We first briefly review the existing mobility models in related research areas such as wireless ad hoc network and cellular networks. Further on, we propose a dedicated and more realistic mobility model named BAMM (Body Area Mobility Model) for wireless body sensor networks by concentrating on the unique characteristics of WBSN and finally study the effects of mobility on the performance of WBSN by simulation experiments.

  • chapterNo Access

    MOBILITY MODEL BASED ON OBSTACLE COLLISION DETECTION FOR AD HOC NETWORKS

    It is an important problem to implement realistic and trustworthy models in Ad hoc networks simulation, and node’s mobility pattern and traffic pattern are two key models. After introduction of obstacle in a simulation terrain, the node’s movement pattern will be affected by collision between nodes and obstacles (static obstacle and dynamic obstacle). The node’s movement pattern can be predicted and decided by using obstacle collision detection method, and obstacles also affect node’s signal propagation. This paper considers above two factors and implements an Ad hoc network mobility model. Simulation shows that this model has a significant impact on performance of protocols.