Chiranjeev Kumar

Multi home agent and pointer-based (MHA-PB) location management scheme in integrated cellular-WLAN networks for frequent moving users

In this paper, we introduces a multi home agent and pointer-based location management scheme. Multi home agent preserves the location information for different wireless technologies (Universal Mobile Telecommunication system, Wireless Local Area Networks) and maintains a cache for the location information of mobile host. In addition, an index based call delivery system has been proposed. The performance comparisons and numerical analysis are helpful to find out the efficiency and effectiveness of the proposed system, with respect to existing location management techniques (single registration scheme, and dual home agent scheme). It has been observed that the registration cost, call setup delay, registration delay and overhead at mobile switching center are reduces in the proposed MHA-PB scheme.

Prioritizing the solution of cloud service selection using integrated MCDM methods under Fuzzy environment

Cloud service selection plays a crucial role in terms of on-demand service selection on a subscription basis. As a result of wide-range availability of cloud services with similar functionalities, it is very crucial to determine which service best addresses the user’s desires and objectives. This paper aims to design a new cloud service selection model under the fuzzy environment by utilizing the analytical hierarchy process (AHP) and fuzzy technique for order preference by similarity to ideal solution (TOPSIS). The AHP method is enforced to configure the structure of cloud service selection problem and to impel the criteria weight using the pairwise comparisons, and the TOPSIS method utilizes the final ranking of the solution. In our proposed model, the non-functional quality of service requirements is taken into consideration for selecting appropriate service. Furthermore, the proposed model exploits a set of pre-defined linguistic variables, parameterized by triangular fuzzy numbers for evaluating each criteria weights. The experimental results obtained using the real-time cloud service domains prove the efficacy of our proposed model and demonstrate the effectiveness by inducing better performance, when compared against other available cloud service selection algorithms. Finally, the sensitivity analysis is persuaded to confirm the robustness of our proposed model.

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.

An effective pointer-based HLR location registration scheme in location management for PCS networks

In this paper, a pointer based HLR (Home Location Register) scheme for location management in PCS (Personal Communication Service) network is presented. The proposed scheme maintained cache information at each HLR database. Whenever the Mobile Terminal (MT) moves from old service area to new service area, its entry will enter in to the cache that is maintained by the old service area. This entry tells about information of MT, i.e., to which SA (Service Area) it has gone. An analytical model is developed for studying the performance of the proposed scheme.

A scalable generic transaction model scenario for distributed NoSQL databases

With the development of cloud computing and internet; e-Commerce, e-Business and corporate world revenue are increasing with high rate. These areas not only require scalable and consistent databases but also require inter database transaction support. In this paper, we present, a scalable three-tier architecture along with a distributed middle-ware protocol to support atomic transactions across heterogeneous NoSQL databases. Our methodology does not compromise on any assumption on the accuracy of failure modalities. Hence, it is suitable for a class of heterogeneous distributed systems. To achieve such a target, our architectural model exploits an innovative methodology to achieve distributed atomic transactions. We simulate this architectural setup with different latency tests under different environments to produce reliable impact and correctness. This study proposes a three-tier architecture to facilitate atomic transactions among heterogeneous NoSQL distributed database environment as HBase.The first tier called client tier, deals with user requests. The client tier wraps transaction request and deliver it to a corresponding global transaction manager (GTM), which is assigned by a manager node.The second tier called middle tier, contains a zookeeper, manager nodes, and labour nodes. Zookeeper assigns an active manager node to the client and the active manager node assigns a labour node to process the transaction.The third tier called distributed tier manages multiple heterogeneous NoSQL databases participating with different transactions.Experimental results show that the proposed architecture is scalable and fault tolerated.

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

An AMAP (Adaptive Mobility Anchor Point) has been proposed 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 mobile users. 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.

An Efficient Routing Protocol for Ad-Hoc Networks

A mobile ad-hoc network is infrastructure less, self organizable, multi hop packet switched network. In ad-hoc network, node movements results in dynamic topology and frequent link failures. Studies shows that on demand protocols perform better compared to table driven protocols. Ad-hoc On Demand Routing (AODV) is one of the popular on demand routing protocol. In this paper, we have proposed an innovative method by considering the MAC layer feed back to reduce the route discovery latency and routing overhead of AODV protocol. Also proposed a new approach of preemptive route maintenance to miti gate the delays and overhead incurred during the original AODV. We implemented and simulated the proposed scheme in NS 2. Simulation results show that the pro posed scheme performs better than AODV.

Ant-system-based location management scheme for wireless cellular networks

The current era of mobile networks allow users to communicate while they are moving. These network facilities are dealt by the location management (LM). In this article, the authors are proposing a nature-inspired LM technique based on ant system. The bottom line of proposed scheme is to follow the route of ahead entities and perform the LM based on it. The performance evaluation is carried out and is compared with existing LM scheme. It is observed that the signalling cost, network traffic and overheads are reduced, as compared to traditional LM scheme, in the communication network.

Partially Overlapping Super Location Area (POSLA): An Efficient Scheme for Location Management in PCS Networks

A partially overlapping super location area (POSLA) Scheme is suggested to overcome the varying updation problem of Overlapping Super Location Area (OSLA) Scheme. In this scheme, the LA is partially overlapped by its surrounding LAs and the location updates will be done based on the minimum distance from the center cell. The suggested scheme, POSLA, shows the reduction in the location update cost as compared to OSLA scheme.

BERA: a biogeography-based energy saving routing architecture for wireless sensor networks

Biogeography-based optimization (BBO) is a relatively new paradigm for optimization which is yet to be explored to solve complex optimization problems to prove its full potential. In wireless sensor networks (WSNs), optimal cluster head selection and routing are two well-known optimization problems. Researchers often use hierarchal cluster-based routing, in which power consumption of cluster heads (CHs) is very high due to its extra functionalities such as receiving and aggregating the data from its member sensor nodes and transmitting the aggregated data to the base station (BS). Therefore, proper care should be taken while selecting the CHs to enhance the life of the network. After formation of the clusters, data to be routed to the BS in inter-cluster fashion for further enhancing the life of WSNs. In this paper, a biogeography-based energy saving routing architecture (BERA) is proposed for CH selection and routing. The biogeography-based CH selection algorithm is proposed with an efficient encoding scheme of a habitat and by formulating a novel fitness function that uses residual energy and distance as its metrics. The BBO-based routing algorithm is also proposed. The efficient encoding scheme of a habitat is developed, and its fitness function considers the node degree in addition to residual energy and distance. To exhibit the performance of BERA, it is extensively tested with some existing routing algorithms such as DHCR, Hybrid routing, EADC and some bio-inspired algorithms, namely GA and PSO. Simulation results confirm the superiority/competitiveness of the proposed algorithm over existing techniques.