Wyniki wyszukiwania - BazTech

1

CAC DPLB MCN: A Distributed Load Balancing Scheme in Multimedia Mobile Cellular Networks

Sharma A., Shah A., Chatterjee M., Bhattacharya U.

Foundations of Computing and Decision Sciences

|

2016

|

Vol. 41, No. 4

261--296

EN

The problem of non-uniform traffic demand in different cells of a cellular network may lead to a gross imbalance in the system performance. Thus, the users in hot cells may suffer from low throughput. In this paper, an effective and simple load balancing scheme CAC_DPLB_MCN is proposed that can effectively reduce the overall call blocking. This model considers dealing with multi-media traffic as well as time-varying geographical traffic distribution. The proposed scheme uses the concept of cell-tiering thereby creating fractional frequency reuse environment. A message exchange based distributed scheme instead of centralized one is used which help the proposed scheme be implemented in a multiple hot cell environment also. Furthermore, concept of dynamic pricing is used to serve the best interest of the users as well as for the service providers. The performance of the proposed scheme is compared with two other existing schemes in terms of call blocking probability and bandwidth utilization. Simulation results show that the proposed scheme can reduce the call blocking significantly in highly congested cell with highest bandwidth utilization. Use of dynamic pricing also makes the scheme useful to increase revenue of the service providers in contrast with compared schemes.

2

RSRP: A Robust Secure Routing Protocol in MANET

Sinha D, Bhattacharya U., Rituparna C

Foundations of Computing and Decision Sciences

|

2014

|

Vol. 39, No. 2

129--154

EN

In this paper, we propose a novel algorithm RSRP to build a robust secure routing protocol in mobile ad-hoc networks (MANETs). This algorithm is based on some basic schemes such as RSA-CRT for encryption and decryption of messages; CRT for safety key generation, Shamir’s secret sharing principle for generation of secure routes. Those routes which are free from any malicious node and which belong to the set of disjoint routes between a source-destination pair are considered as probable routes. Shamir’s secret sharing principle is applied on those probable routes to obtain secure routes. Finally, most trustworthy and stable route is selected among those secure routes. Selection of the final route depends on some criteria of the nodes present in a route e.g.: battery power, mobility and trust value. In addition, complexity of key generation is reduced to a large extent by using RSA-CRT instead of RSA. In turn, the routing becomes less expensive and most secure and robust one. Performance of this routing protocol is then compared with non-secure routing protocols (AODV and DSR), secure routing scheme using secret sharing, security routing protocol using ZRP and SEAD depending on basic characteristics of these protocols. All such comparisons show that RSRP shows better performance in terms of computational cost, end-to-end delay and packet dropping in presence of malicious nodes in the MANET, keeping the overhead in terms of control packets same as other secure routing protocols.

3

Reducing Call Blocks in Cellular Network with Non-Uniform Traffic Conditions

Sharma A., Sharma P., Chaki R, Bhattacharya U.

Foundations of Computing and Decision Sciences

|

2014

|

Vol. 39, No. 4

301--318

EN

In cellular networks, while the motivation behind all basic channel assignment strategies is the better utilization of the available frequency spectrum with the consequent reduction of the call blocking probability in each cell, very few of them deal with the problem of non-uniform traffic demand in different cells which may lead to a gross imbalance in the system performance. Mobile users in hot cells (the cells with heavy traffic loads) may suffer from low throughput due to the load imbalance problem. In this paper, we propose a cost effective and simple load balancing scheme that can effectively reduce the overall call blocking. A common set of channels are determined dynamically which can be used simultaneously in all the cells. Cell tiers with different radii are used to cope with the interference introduced by using same set of channels simultaneously in all cells. The performance of the proposed scheme is presented in terms of call blocking probability and channel utilization. Simulation results show that the proposed scheme can reduce the call blocking significantly in highly congested cell.

4

Clar: A novel cluster oriented agent based routing protocol for manet

Sinha D, Bhattacharya U., Chaki R

Foundations of Computing and Decision Sciences

|

2013

|

Vol. 38, No. 1

3--23

EN

In this paper we propose a novel algorithm CLAR to build an agent based routing protocol using ACO technique in cluster based mobile ad-hoc networks. Clustering makes possible hierarchical routing in which paths are recorded between cluster-heads instead of nodes. This reduces routing overheads. Presence of an unstable and non-reliable cluster-head degrades the performance of the network since cluster-heads of the network take active role in routing messages between a source destination pair. The proposed algorithm chooses the most reliable and stable node as cluster-head depending on four criteria i.e.: stability, battery power, degree, and trust value of the node. It also uses a multiagent based routing algorithm to generate load balanced routes between source and destination in cluster-based network. Performance of CLAR is compared with other existing efficient algorithms such as AODV, CBRP, Wu & Li’s Algorithm, dominating set based clustering algorithms, agent-based algorithms named as SACO and MALBACO. Simulation results prove that the proposed protocol combines merits of both clustering approach and agent based approach and provides efficient packet delivery even in the presence of high load in the network.

5

Overview of shufflenet and its variations in lightwave networks

Bhattacharya U., Ghassemlooy Z.

Foundations of Computing and Decision Sciences

|

2006

|

Vol. 31, No. 3-4

193-220

EN

This paper outlines a review of application of ShuffleNet and its variations as logical topologies in lightwave networks and tries to consolidate the results reported so far. ShuffleNet, a very popular interconnection structure, proposed by Acampora as a logical topology in multihop optical networks has been generalized later with a view to obtaining a network topology for optimal throughput. Bilayered ShuffleNet has been designed to reduce the diameter and average hop distance compared to ShuffleNet. But, absence of any simple bidirectional self-routing scheme in Bilayered ShuffleNet led to design SW-Banyan network, an isornorphic equivalent of the ShuffleNet offering a convenient layout. Bi-directional ShuffleNet facilitates lesser hopping distance between any source-destination pair compared to ShuffleNet. Multistar Implementation of expandable ShuffleNet and GEMNet have been developed to insert flexibility in the structure of ShuffleNet.

6

An automated environment for generation of rapid prototypes

Bhattacharya S., Bhattacharya J., Chaudhuri A. R., Bhattacharya U.

Foundations of Computing and Decision Sciences

|

2004

|

Vol. 29, No. 4

287-314

EN

This paper introduces a prototyping environment based on a new formal model, ASET (Advanced System Emulation Technique). ASET is designed to aid rapid prototyping of software systems. It can be used to generate executable code directly from design specifications, together with provision for developers to add their own implementable codes, which will be incorporated in the final executable model. ASET also involves a well-defined design specification having provision for implementing both control and data flow. This model has been developed to allow specification of data dependent control conditions. Features, which have been given special consideration here, include distributed systems and concurrent processes. A grammar for this design specification is provided, which has been implemented and verified by YACC. The working of the presented technique has been illustrated using a case study.