Breakthrough Science Society

India’s recent connectivity projects in the East, like the USD 484 million Kaladan Multi-Modal Transport Project, stem from a compulsion imposed by the sub-continent’s post-Partition geography. Pakistan lost its eastern wing in a bloody civil war in 1971 because it was logistically impossible for its army to hold on to an alienated province with millions of Bengalis up in arms and their insurrection fully backed by India. India did not lose its restive ‘Seven Sisters’ in the Northeast, but a spate of violent insurgencies by battling ethnicities (Naga, Mizo, Manipuri, Assamese, Bodos and other tribes) challenged Delhi’s control over the remote region. That has compelled post-colonial India to seek alternate trans-national connectivity to the region to get round the limitations imposed by the 21 km wide ‘Siliguri Corridor’, the only land link connecting the Indian mainland to the Northeast. A combined armoured-infantry-airborne thrust by China through the Zompheri Ridge down the Chumbi Valley and Jaldhaka, cutting off this Siliguri Corridor – this is the worst nightmare scenario for India’s military planners.

At present a majority of computer and telecommunication systems requires data security when data is transmitted the over next generation network. Data that is transient over an unsecured Next Generation wireless network is always susceptible to being intercepted by anyone within the range of the wireless signal. Hence providing secure communication to keep the user's information and devices safe when connected wirelessly has become one of the major concerns. Quantum cryptography algorithm provides a solution towards absolute communication security over the next generation network by encoding information as polarized photons, which can be sent through the air security issues and services using cryptographic algorithm explained in this chapter.

A simple planar monopole antenna structure is presented in this paper. The proposed antenna gives desirable performance in two band of frequencies ranging from 1.70-2.16 GHz and 3.7-3.9 GHz covering thirteen full LTE bands Bl, B2, B3, B4, B9, BIO, B25, B33, B34, B35, B36, B37, B39 and one LTE band-B43 partially. The parametric study is incorporated to obtain an optimized geometry. The designed antenna structure is simulated using IE3D simulation software and the simulated curves of s-parameter, radiation pattern, gain and efficiency are presented and discussed.

This paper presents a novel method for solving channel assignment problems (CAPs) in hexagonal cellular networks with nonhomogeneous demands in a 2-band buffering system (where channel interference does not extend beyond two cells). The CAP with nonhomogeneous demand is first partitioned into a sequence of smaller subproblems, each of which has a homogeneous demand from a subset of the nodes of the original network. Solution to such a subproblem constitutes an assignment phase, where multiple homogeneous demands are assigned to the nodes corresponding to the subproblem, satisfying all the frequency separation constraints. The whole assignment process for the original network consists of a succession of multiple homogeneous assignments for all the subproblems. Based on this concept, we present a polynomial time approximation algorithm for solving the CAP for cellular networks having nonhomogeneous demands. Our proposed assignment algorithm, when executed on well-known benchmark instances, comes up with an assignment which is always within about 6 percent more than the optimal bandwidth, but requires a very small execution time (less than 5 millisecond on a HPxw8400 workstation). The proposed algorithm is very much suitable for real-life situations, where fast channel assignment is of primary importance, tolerating, however, a marginal deviation (6 percent) from the optimal bandwidth.

This work proposes a novel dynamic and adaptive yet fair spectrum allocation policy to be adopted by a service provider (SP). Here, we consider a scenario where a single SP owns multiple access networks (ANs) of different (not necessarily competing) technologies. We conceive that an SP employs an entity, called local spectrum controller (LSC), which manages the common pool of spectrum and is responsible for distributing the spectrum to individual ANs in a fair manner. Since the available spectrum is insufficient to satisfy the aggregate demand from all ANs simultaneously, LSC has to resort to a dynamic spectrum allocation technique. We have modeled the problem as an n-player cooperative bankruptcy game and have solved the problem with the help of Shapley value. We have proposed a suitable utility function for the AN with respect to its received spectrum and have identified possible objectives of LSC (i.e., SP) namely, maximizing equality of distribution (MED) and maximizing proportional fairness (MPF). We have proposed a novel equal utility distribution (EUD) algorithm that maximizes our MED objective. Finally, we have studied performances of EUD, Shapley value and max-min fairness algorithm with respect to the above objectives and have compared with nucleolus solution concept.