Browsing by Author "Narang, Nishit"

Now showing 1 - 12 of 12

2.5G MOBILE NETWORKS: GPRS and EDGE
(McGraw Hill, 2008) Narang, Nishit
his book culminates the trilogy of books written by Sumit Kasera and Nishit Narang on three key wireless technologies "2G. 2.5G and 3G Mobile Networks. Even though 2G and 2.5G technologies, as compared to 3G, are more than a decade old, the current corporate battle for 2G spectrum in India, indicates the significance and growth potential of these technologies including GSM and GPRS. 2.5G Mobile Networks is a complete coverage of GPRS and EDGE concepts presented in simple non-technical language without complex mathematics. An ideal primer for those working in or studying networking technologies, this book focuses mainly on procedures and basis of signaling exchanges. Readers will find a detailed treatment on GPRS network architecture, a healthy mix of concepts and protocols of Air Interface and Core Network, discussion on GPRS user-plane aspects with focus on user-plane protocols, important aspects of EDGE and much more. This book will be a valuable guide to both engineers as well as students working on GPRS and EDGE. It will also be a great follow up for those will knowledge on GSM and want to know more on the intermediate technologies before studying 3G UMTS.
2G Mobile Networks Gsm & Hscsd
(McGraw Hill, 2007) Narang, Nishit
Readers will gain a thorough and quick understanding of GSM networks-from air interface to core network and the available services. The book provides an exhaustive coverage of protocol architecture and procedures, including radio resource and mobility management, as well as call handling. It begins by laying down the fundamentals of GSM technology ? cellular concepts, network and protocol architecture of GSM. This is followed by a discussion of GSM air interface that covers important topics including GSM frame hierarchy, burst structure, physical and logical channels. The discussion then moves onto the three logical parts of any basic wireless architecture-Mobile Station, Access and Core Networks. Important procedures of access and core networks are discussed next. The book ends with discussions of service aspects of GSM networks. These include voice transfer, SMS, cell broadcast service, location services and finally circuit switched data, and the more advanced high-speed circuit switched data. About The Author: Nishit Narang is Senior Technical Leader at Flextronics Software Systems India. He has a B. Tech. degree in Computer Science and Engineering from IIT, Delhi, India, and an M.S degree in Software Systems from Birla Institute of Technology and Science, Pilani, India. Nishit's current areas of interest include software development for GSM, GPRS and 3G networks & Sumit Kasera is Senior Technical Leader at Flextronics Software Systems (formerly Hughes Software Systems), India. He has a B. Tech degree in Computer Science and Engineering from IIT, Kharagpur, India and an M.S degree in Software Systems from Birla Institute of Technology and Science, Pilani, India. Table of Contents Part I: GSM Introduction and Background 1. GSM Overview 2. GSM Air Interface Part II: GSM Network Architecture 3.
3G Mobile Networks: Architecture, Protocols and Procedures
(McGraw Hill, 2004) Narang, Nishit
In India, the mobile subscriber baser is increasing at a phenomenal rate. After the successful adoption of Second Generation (2G) Technology GSM and 2.5G Technology GPRS, the industry is now rapidly moving towards Third Generation (3G) Networks. The book, written by two young engineers, touches almost every imaginable aspect of a 3G Network, spanning across topics such as: • UMTS Network Architecture (including Access Network and Core Network), • Protocols (including RRC, NBAP, RANAP, MM/GMM, MAP and GTP), • Procedures (including UTRAN Procedures, Mobility Management, Call/Session handling and Security Management), and • Services (including Supplementary Services and Value-added Services). Also the book covers topics like IP Multimedia Sub-system (IMS) and SIGTRAN. Besides these, the book includes the status of deployment of 3G UMTS Networks across the world and provides a brief introduction to 4G Networks setting the tone for future advancements. With this coverage, the book would serve the needs of telecom engineers and students.
An Analysis on the Effectiveness of Utilizing Facebook Graph Structure for Trust Management in a Social Iot Network
(CRC, 2020) Narang, Nishit
The last few years have seen rapid growth in cyberspace social networking, with applications like Facebook, Twitter and many other similar social networking sites growing by leaps and bounds. Huge volumes of data, collected from social networking sites like Facebook (FB) can yield significant insights, some of which can be extremely useful in operations of cyber-physical systems (or CPS). Social IoT (or SIoT), an amalgamation of social networking techniques to IoT networks, is one of the growing research areas within CPS. SIoT offers a new and novel approach to network IoT devices, whereby IoT devices collaborate in a machine-to-machine (or M2M) social network, just like humans collaborate in a human social network, to solve a larger problem in a socially collaborative manner. While the approach of structuring IoT networks as a social network of collaborative devices enables an efficient deployment of a service network, it has its own security challenges. In a multi-vendor heterogeneous network of IoT devices, the challenge of identifying trustworthy devices (or friendly devices) is a tricky problem. In this paper, we first introduce the need for identification of trustworthy ties for operations in heterogeneous SIoT networks. We then briefly introduce the approach of using information available from human social networks to identify trustworthy device ties in SIoT networks. While the approach appears to be simple and elegant, the effectiveness of the approach is completely dependent on the reliability of data available from human social networks. The focus for the remainder of the paper is to use dataset analysis as means to measure the effectiveness of using Facebook social network graph for identification of trustworthy ties in SIoT networks. The assessment is equally useful when devising similar approaches for use in other CPS networks.
ATM Networks: Concepts and Protocols
(McGraw Hill, 2006) Narang, Nishit
Networking technologies are playing a pivotal role in ‘networking’ our world. Among the networking technologies that are relevant today, ATM is one of the most popular and pervasive as it seamlessly integrates local area networks and wide area networks. Further, as it provides a single platform for voice, video and data, it facilitates convergence. ATM Networks: Concepts and Protocols is a single-stop reference on this technology. The revised edition of this book covers the relevant concepts, the three layers of ATM protocol reference model, core concepts of ATM networks (including signaling, routing and traffic management), interworking aspects and the application of ATM networks.
Communication Networks: Principles and Practice
(2005) Narang, Nishit
Communication Networks: Principles and Practice is a simple and jargon-free presentation on the core concepts of networking. The book adopts a novel approach, wherein each chapter first details a particular concept of networking and then explains it using examples from contemporary technologies like TCP/IP, ATM, 3G Networks, etc.
Efficient algorithms for delay-bounded minimum cost path problem in communication networks
(IEEE, 1998) Narang, Nishit
As the amount of data transmitted over a network increases and high bandwidth applications requiring point to multipoint communications like videoconferencing, distributed database management or cooperative work become widespread, it becomes very important to optimize network resources. One such optimization is multicast tree generation. The problem of generating a minimum cost multicast tree given the network topology and costs associated with the connecting links can be modelled as a Steiner tree problem which is NP-complete. Much work has been done in the direction of obtaining near-optimal multicast trees when the objective is only to minimize the cost. However, many real time applications such as videoconferencing require that data be sent within prespecified delay limits in order to avoid problems such as anachronism and lack of synchronization. We deal with the delay-bounded cost-optimal multicast tree (DBCPAT) generation problem. Specifically, we discuss a closely related problem which is to find a delay-bounded cost-optimal path (DBCP) between a specified source and destination node. Such a path can be used as a starting point to solve the DBCMT. We present an exact solution to the DBCP which is based on the branch-and-bound paradigm. We also propose a heuristic technique to solve the DBCP using the principle of evolutionary computing. The results obtained using the two techniques are compared for several large networks.
Efficient Algorithms for Delay-bounded Multicast Tree Generation for Multimedia Applications
(Springer, 1999) Narang, Nishit
Given a network topology and costs associated with the links, the problem of generating a minimum cost multicast tree can be modelled as a Steiner tree problem. However, many real time applications such as video-conferencing require that data be sent within prespecified delay limits in order to avoid problems such as anachronism and lack of synchronization. This paper deals with the delay-bounded cost-optimal multicast tree (DBCMT) generation problem. A closely related problem is to find a delay-bounded cost-optimal path (DBCP) between a specified source and destination node. Such a path can be used be used as a starting point to solve the DBCMT. We present here two heuristics for building delay constrained multicast trees which have near optimal cost. A comparison of our heuristics with other proposed heuristics is also presented.
A hybrid trust management framework for a multi-service social IoT network
(Elsevier, 2021-04) Narang, Nishit
Social IoT (or SIoT) is an alternate architectural pattern for IoT, which involves IoT devices with social behavioural attributes. A SIoT-based service network makes use of social collaboration between IoT devices to enable low-latency collaborative services and applications. A key challenge in implementing a SIoT-based service network in a multi-vendor environment of heterogeneous devices is the issue of Trust. In this paper, we propose a hybrid trust management framework that makes use of Probabilistic Neighbourhood Overlap (P-NO), a method for estimating tie-strengths between nodes. The neighbourhood overlap concept is borrowed from past research in sociology and extended in our paper for directed social networks. Our proposed trust management framework is hybrid because: (1) P-NO is applied on a social graph that is generated from two types of social networks — the IoT device owners’ online social network (like Facebook) and the IoT-devices’ social network (i.e. the SIoT network). Accordingly, the approach makes use of both human intelligence and device artificial intelligence for trust management. (2) The framework uses a mix of dynamic (interaction-based) and static (graph-based) approach for trust management. It helps in limiting resource overheads of a pure dynamic approach, while still benefiting from its higher accuracy compared to a pure-static approach. We provide both theoretical and simulation-based analysis of our trust management framework. Our study shows the effectiveness of the proposed framework in handling different attack scenarios while requiring limited storage and computational resources in IoT devices.
A Neighborhood Overlap Based Approach for Service Provider Prioritization in a Directed Social IoT Service Network
(ACM Digital Library, 2020-01) Narang, Nishit
Social IoT (or SIoT) is an alternate architectural pattern for IoT, which involves imparting social behavioral attributes to IoT devices. An SIoT service network uses social collaboration between IoT devices (acting as service users or service providers or both), enabling low-latency collaborative services and applications. A key challenge in implementing an SIoT service network in a multi-vendor network of heterogeneous IoT devices is the issue of Trust. The problem is in prioritization and selection of trustworthy service provider(s) in an autonomous and independent manner. In a single-vendor network, the problem is handled via proprietary methods that do not scale for multi-vendor environments. The problem is further compounded in networks having IoT devices that are constrained in computational and storage resources. In this paper, we propose the use of Neighborhood Overlap for estimating tie-strengths and the consequent prioritization of service providers based on the estimated tie-strength. We verify the relationship between neighborhood overlap and tie-strength using three publicly available datasets. While past research on neighborhood-overlap and its relationship with tie-strength focuses on undirected social networks only, we extend the definition of neighborhood-overlap for directed networks. We further prove this extension with the help of two publicly available directed social network datasets. The idea proposed in this paper is fundamental and can be extended towards defining a trust framework for SIoT.
Utilizing Social Networks Data for Trust Management in a Social Internet of Things Network
(ACM Digital Library, 2018) Narang, Nishit
Social Internet of Things (SIoT), an amalgamation of Social Networking concepts to the Internet of Things (IoT), is a strong architectural alternative for IoT solutions. A lot of research work in SIoT has proposed the use of social networking data for community and trust management in SIoT networks. While it seems like an interesting choice, it is important to analyze the effectiveness of social networking data for application to SIoT. In this paper, we analyze the accuracy of using tie information from the Facebook Friend Graph to mimic real-world SIoT network ties. We also discuss a method for ranking the strength of ties in a SIoT network by analyzing the structure of the Facebook Friend Graph. A similar analysis can be performed on data available from other Social Networking platforms, like Twitter, LinkedIn etc.
Your Tribe Decides Your Vibe: Analyzing Local Popularity in the US Patent Citation Network
(ARXIV, 2021-06) Narang, Nishit
In many networks, the indegree of a vertex is a measure of its popularity. Past research has studied indegree distributions treating the network as a whole. In the US Patent citation network (USPCN), patents are classified into categories and subcategories. A natural question arises: How do patents gather their popularity from various (sub)categories? We analyse local indegree distributions to answer this question. The citation (indegree) of a patent within the same category indicates its internal popularity, while a cross-category citation indicates its external popularity. We analyze the internal and external indegree distributions at each level of USPCN hierarchy to learn how the internal and external popularity of patents varies across (sub)categories. We find that all (sub)categories have local preferences that decide internal and external patents' popularities. Different patents are popular in different groups: Groups C1, C2 and C3 may not agree on popular patents in C1. In general, patent popularity appears to be a highly local phenomenon with subcategories (not even categories) deciding their own popular patents independent of the other (sub)categories