An Index-Based Location Management Scheme for PCS Network

Location management provides the guarantee to deliver a call to mobile user during the mobility of user and it is a key challenge in wireless cellular networks. In this paper, we are introducing a new index-based location management scheme. It is based on indexing of location update information at the home agent of network. A tuple of index will keep track of range of location update information and corresponding thread of it, connected to stack of information table. To register a new mobile user, the mobile switching centre will generate a new identification number with the help of mobile switching centre identification number and temporary mobile subscriber identity of subscriber. If, the identification number is with in the range of index then, the Care of Address of mobile subscriber is added to information table else, the index will be reconstruct based on new range of identification number. It has been observed that in proposed technique, the call setup delay and network overheads is reduces over the limitation of minor increment of registration delay. The analytical model and numerical result represents the effectiveness of proposed scheme over the existing schemes.     

Analysis and modelling the effects of mobility,Churn rate,node’s life span,intermittent bandwidth and stabilization cost of finger table in structured mobile P2P networks

Today P2P (Peer-to-Peer) networks are gaining popularity for sharing the contents. Due to massive spreading of Internet, these networks are also growing fast. MP2P (Mobile P2P) networks are attracting many users due to increase in the Internet-based mobile applications. These networks suffer from many challenges which are not considered for analysis and modelling adequately. We focus on few challenges like mobility of users, churn rate, intermittent bandwidth, shorter life span of mobile nodes, stabilization of finger table, etc. in this paper. We analytically analyse these challenges and define the effects of different parameters over the performance. Traditional P2P protocols are designed for wired networks and when these are implemented for mobile networks then mobility effect of users adds more challenge for researchers. We select two types of mobility models namely FF (Fluid Flow) and RWP (Random Waypoint) models to model the users’ mobility. The churn rate of the mobile nodes makes network overlay management and content searching more difficult in MP2P networks. We select finger table-based protocols which are widely deployed in the P2P networks. But these protocols can’t perform well in the mobile P2P networks due to mobility of the users. The mobility of the users and churn rate of the mobile nodes create failure in lookup of finger table and induce more cost to update the finger table. We consider these challenges and quantify the failure rate of mobile nodes, life span of mobile nodes, available bandwidth, cost of stabilization of finger table per node, etc. in this proposal. The proposed model is useful for modelling the performance of MP2P networks performance in various wireless environments like Mobile Ad hoc Networks (MANETs), Wireless Mesh Networks (WMNs), Wireless Sensor Networks (WSNs), Vehicular Ad hoc Networks (VANETs), Wireless LAN (WLAN), Wireless MAN (WMAN), etc.

     

Finger Forwarding Scheme to Reduce Lookup Cost in Structured P2P Networks

Wireless Personal Communications - Peer-to-peer (P2P) networks are distributed systems where each user shares his resources and cooperates with other users. These networks are designed over...     

CRWO: Clustering and routing in wireless sensor networks using optics inspired optimization

In wireless sensor networks (WSNs), cluster head (CH) selection and routing are two well known optimization problems associated with high computational complexity for large scale networks. Optics inspired optimization (OIO) is one of the recent meta-heuristic techniques used to solve a wide range of NP-Hard problems. In this study, firstly an OIO based CH selection algorithm is proposed by considering various parameters such as energy, distance and node degree. Next, clusters are formed using derived potential function. Finally, an OIO based routing algorithm is proposed to compute the route from each CH to the base station (BS) using the same parameters like energy, distance and node degree. In the performance evaluation, the proposed algorithm (CRWO) is extensively tested and compared with some of the existing algorithms based on both conventional and nature inspired routing techniques. Simulation results depict the superiority of the proposed algorithm over its comparatives.     

Resource-Cardinality Based Scheme to Reduce Resource Lookup Cost in Structured P2P Networks

A P2P (peer-to-peer) network is a distributed system dependent on the IP-based networks, where independent nodes join and leave the network at their drive. The files (resource) are shared in distributed manner and each participating node ought to share its resources. Some files in P2P networks are accessed frequently by many users and such files are called popular files. Replication of popular files at different nodes in structured P2P networks provides significant reduction in resource lookup cost. Most of the schemes for resource access in the structured P2P networks are governed by DHT (Distributed Hash Table) or DHT-based protocols like Chord. Chord protocol is well accepted protocol among structured P2P networks due to its simple notion and robust characteristics. But Chord or other resource access protocols in structured P2P networks do not consider the cardinality of replicated files to enhance the lookup performance of replicated files. In this paper, we have exploited the cardinality of the replicated files and proposed a resource cardinality-based scheme to enhance the resource lookup performance in the structured P2P networks. We have also proposed the notion of trustworthiness factor to judge the reliability of a donor node. The analytical modelling and simulation analysis indicate that the proposed scheme performs better than the existing Chord and PCache protocols.

     

An efficient metric-based (EM-B) location management scheme for wireless cellular networks

In the current era, the wireless cellular network is gaining much attention in the network mobility for qualitative service. Towards enhancing the QoS and narrowing the dilemma of network management (location management) an efficient metric-based location management technique is introduced in this paper to capture the current location of mobile subscribers. The attributes of this technique are based on metrics calculation and location management message routing path determination. First, the current mobile switching center will calculate the shortest metric-based path between current and master (previous) location of mobile terminals (user), thereafter it performs the location management procedure through the optimal suggested path by the mobile switching center. This proposed technique will reduce the signaling cost, registration delay, call setup delay, network overheads and total location management cost. The proposed analytical model checks the scalability and effectiveness of proposed system over certain attributes and a comparison is made with the existing available techniques.     

Adaptive mobility anchor point to reduce regional registration and packets delivery costs

MIPv6 (Mobile IPv6) has been developed as macro-mobility management protocol to support mobility of MUs (mobile users) over the Internet. Hierarchical Mobile IPv6 (HMIPv6) has been developed as micro-mobility management protocol. There are many other mobility management protocols proposed so far like Fast Mobile IPv6, Proxy Mobile IPv6, Optimal Choice of Mobility management, and Fast Proxy Mobile IPv6. These are based on MIPv6 and HMIPv6 and have their own advantages and limitations. These protocols do not consider the fixed mobility pattern of MUs. Many MUs have fixed mobility pattern on daily basis and there is scope of further reduction in regional registration cost. We propose an AMAP (Adaptive Mobility Anchor Point) to minimize the regional registration cost and packet delivery cost in IPv6 networks. The AMAP is a special mobility anchor point which is selected based on the activity rate (ARate) of MUs.     

Hybrid Scheme with Adaptive Replication and Mobility Anchoring Point (MAP) in Wireless Networks

Replication strategy is mostly useful for replicating the mobile user’s profile at selected locations from which some callers have higher calling rate. Location management scheme also include replication strategy to reduce the location lookup cost of called mobile user. It plays important role in personal communication services in order to reduce call setup cost, call setup time, and increases the QoS (quality of service). In prior replication schemes, called user’s location profile is placed at some fixed and limited number of visitor location registers (VLRs) based on call history of the caller. In prior hybrid schemes location update and replication strategies are combined together. These prior hybrid schemes apply pointer forwarding strategy and replication. But these schemes have limitations like holding “loose” form of location profile and higher location update cost. We have proposed a new hybrid scheme which includes adaptive replication of updated user’s location profile and mobility anchoring point (MAP) for location update. The main objective of the proposed scheme is to reduce call setup cost and call setup time. In order to achieve the objective, adaptive replication is applied at certain visitor location registers (VLRs) according to movement of caller. The replica is kept updated at MAP and replicated to neighbor VLRs as per movement of the caller. We have presented fluid-flow based analytical modeling which shows that proposed scheme outperforms the prior hybrid scheme.     

Mobility Pattern Based Chord (MP-Chord) for Enhanced Lookup Performance in Mobile P2P Networks

Wireless Personal Communications - The peer-to-peer (P2P) systems are mainly designed for wired networks. These networks suffer from many challenges like malicious content distribution, free...