Wireless Communications in the Era of Big Data

The rapidly growing wave of wireless data service is pushing against the boundary of our communication network's processing power. The pervasive and exponentially increasing data traffic present imminent challenges to all the aspects of the wireless system design, such as spectrum efficiency, computing capabilities and fronthaul/backhaul link capacity. In this article, we discuss the challenges and opportunities in the design of scalable wireless systems to embrace such a "bigdata" era. On one hand, we review the state-of-the-art networking architectures and signal processing techniques adaptable for managing the bigdata traffic in wireless networks. On the other hand, instead of viewing mobile bigdata as a unwanted burden, we introduce methods to capitalize from the vast data traffic, for building a bigdata-aware wireless network with better wireless service quality and new mobile applications. We highlight several promising future research directions for wireless communications in the mobile bigdata era.Comment: This article is accepted and to appear in IEEE Communications Magazin

A survey on Routing Protocols in Wireless Sensor Networks

In ad-hoc WSN is a collection of mobile nodes that are dynamically and randomly located in such a manner that the interconnections between nodes are changing on a continual basis. The dynamic nature of these networks demands new set of network routing strategy protocols to be implemented in order to provide efficient end-to end communication. Moreover, such issues are very critical due to severe resource constraints like efficient energy utilization, lifetime of network, and drastic environmental conditions in WSNs. Neither hop-by-hop nor neither direct reach ability is possible in case of WSNs. In order to facilitate communication within the network, a routing protocol is used. In this paper we have carried out an extensive survey on WSN protocols based on structure of network, routing protocol of network & clustering techniques of routing protocols

To Proposed a Novel Technique to Remove Effective Collision by Clock Synchronization in Wireless Sensor Network

In wireless communication system, group of nodes forms wireless sensor network (WSN). During communication these nodes makes a suitable path for transferring the information. Size of WSN depends on the type and quality of service, the service coverage area, and the scalability of the service. Data centric, hierarchical routing and location based routing protocols are used in the wireless communication. These routing protocols utilizes diverse amount of energies. The consumption of energy is the major concern in WSN. The energy must be quantized for computational purposes. Giving greater probability to nodes with more energy, to be taken as cluster head, helps in better distribution of energy and more reliable message transmission. Apart from communication, lot of energy is consumed in synchronizing the WSN. In general, WSN has no central controller. In this work initially the cluster heads are chosen by election algorithm for each cluster then diffusion based technique is applied to synchronize cluster head clock. Results shows the synchronized cluster head can reduce the energy consumption, packet loss while increase the throughput

A Survey and Future Directions on Clustering: From WSNs to IoT and Modern Networking Paradigms

Many Internet of Things (IoT) networks are created as an overlay over traditional ad-hoc networks such as Zigbee. Moreover, IoT networks can resemble ad-hoc networks over networks that support device-to-device (D2D) communication, e.g., D2D-enabled cellular networks and WiFi-Direct. In these ad-hoc types of IoT networks, efficient topology management is a crucial requirement, and in particular in massive scale deployments. Traditionally, clustering has been recognized as a common approach for topology management in ad-hoc networks, e.g., in Wireless Sensor Networks (WSNs). Topology management in WSNs and ad-hoc IoT networks has many design commonalities as both need to transfer data to the destination hop by hop. Thus, WSN clustering techniques can presumably be applied for topology management in ad-hoc IoT networks. This requires a comprehensive study on WSN clustering techniques and investigating their applicability to ad-hoc IoT networks. In this article, we conduct a survey of this field based on the objectives for clustering, such as reducing energy consumption and load balancing, as well as the network properties relevant for efficient clustering in IoT, such as network heterogeneity and mobility. Beyond that, we investigate the advantages and challenges of clustering when IoT is integrated with modern computing and communication technologies such as Blockchain, Fog/Edge computing, and 5G. This survey provides useful insights into research on IoT clustering, allows broader understanding of its design challenges for IoT networks, and sheds light on its future applications in modern technologies integrated with IoT.acceptedVersio

A one hop overlay system for Mobile Ad Hoc Networks

Peer-to-Peer (P2P) overlays were initially proposed for use with wired networks. However, the very rapid proliferation of wireless communication technology has prompted a need for adoption of P2P systems in mobile networks too. There are many common characteristics between P2P overlay networks and Mobile Ad-hoc Networks (MANET). Self-organization, decentralization, a dynamic nature and changing topology are the most commonly shared features. Furthermore, when used together, the two approaches complement each other. P2P overlays provide data storage/retrieval functionality and MANET provides wireless connectivity between clients without depending on any pre-existing infrastructure. P2P overlay networks can be deployed over MANET to address content discovery issues. However, previous research has shown that deploying P2P systems straight over MANET does not exhibit satisfactory performance. Bandwidth limitation, limited resources and node mobility are some of the key constraints. This thesis proposes a novel approach, OneHopOverlay4MANET, to exploit the synergies between MANET and P2P overlays through cross-layering. It combines Distributed Hash Table (DHT) based structured P2P overlays with MANET underlay routing protocols to achieve one logical hop between any pair of overlay nodes. OneHopOverlay4MANET constructs a cross-layer channel to permit direct exchange of routing information between the Application layer, where the overlay operates, and the MANET underlay layer. Consequently, underlay routing information can be shared and used by the overlay. Thus, OneHopOverlay4MANET reduces the typical management traffic when deploying traditional P2P systems over MANET. Moreover, as a result of building one hop overlay, OneHopOverlay4MANET can eliminate the mismatching issue between overlay and underlay and hence resolve key lookups in a short time, enhancing the performance of the overlay. v In this thesis, we present OneHopOverlay4MANET and evaluate its performance when combined with different underlay routing protocols. OneHopOverlay4MANET has been combined with two proactive underlays (OLSR and BATMAN) and with three reactive underlay routing protocols (DSR, AODV and DYMO). In addition, the performance of the proposed system over OLSR has been compared to two recent structured P2P over MANET systems (MA-SP2P and E-SP2P) that adopted OLSR as the routing protocol. The results show that better performance can be achieved using OneHopOverlay4MANET

Multicast outing protocols and architectures in mobile ad-hoc wireless networks

The basic philosophy of personal communication services is to provide user-to-user, location independent communication services. The emerging group communication wireless applications, such as multipoint data dissemination and multiparty conferencing tools have made the design and development of efficient multicast techniques in mobile ad-hoc networking environments a necessity and not just a desire. Multicast protocols in mobile adhoc networks have been an area of active research for the past few years. In this dissertation, protocols and architectures for supporting multicast services are proposed, analyzed and evaluated in mobile ad-hoc wireless networks. In the first chapter, the activities and recent advances are summarized in this work-in-progress area by identifying the main issues and challenges that multicast protocols are facing in mobile ad-hoc networking environments and by surveying several existing multicasting protocols. a classification of the current multicast protocols is presented, the functionality of the individual existing protocols is discussed, and a qualitative comparison of their characteristics is provided according to several distinct features and performance parameters. In the second chapter, a novel mobility-based clustering strategy that facilitates the support of multicast routing and mobility management is presented in mobile ad-hoc networks. In the proposed structure, mobile nodes are organized into nonoverlapping clusters which have adaptive variable-sizes according to their respective mobility. The mobility-based clustering (MBC) approach which is proposed uses combination of both physical and logical partitions of the network (i.e. geographic proximity and functional relation between nodes, such as mobility pattern etc.). In the third chapter, an entropy-based modeling framework for supporting and evaluating the stability is proposed in mobile ad-hoc wireless networks. The basic motivations of the proposed modeling approach stem from the commonality observed in the location uncertainty in mobile ad-hoc wireless networks and the concept of entropy. In the fourth chapter, a Mobility-based Hybrid Multicast Routing (MHMR) protocol suitable for mobile ad-hoc networks is proposed. The MHMR uses the MBC algorithm as the underlying structure. The main features that the proposed protocol introduces are the following: a) mobility based clustering and group based hierarchical structure, in order to effectively support the stability and scalability, b) group based (limited) mesh structure and forwarding tree concepts, in order to support the robustness of the mesh topologies which provides limited redundancy and the efficiency of tree forwarding simultaneously, and c) combination of proactive and reactive concepts which provide the low route acquisition delay of proactive techniques and the low overhead of reactive methods. In the fifth chapter, an architecture for supporting geomulticast services with high message delivery accuracy is presented in mobile ad-hoc wireless networks. Geomulticast is a specialized location-dependent multicasting technique, where messages are multicast to some specific user groups within a specific zone. An analytical framework which is used to evaluate the various geomulticast architectures and protocols is also developed and presented. The last chapter concludes the dissertation

Performance analysis of self-organized Ad-Hoc sensor networks

This project deals with a Distributed Sensor Network (DSN). The main focus of this thesis is to deliver an OPNET simulation model for working DSN model. After building a model, various performance analysis techniques in terms of different parameters were used to verify the working model. Query Dominant Sets (QDS) are the main idea behind this thesis. The QDS node is in charge of the nodes for a specific region and its job is to assign the query tasks that it gets to the nodes in that region to help maximize the life of the network. If no user queries are being sent, the QDS nodes themselves go to sleep to conserve energy and just listen for special incoming control signals. QDS management (including the selection of QDS and the interaction of QDS nodes and other common nodes) is a challenging issue in DSN platforms. Our algorithm for QDS management attempts to limit the dead spots in the network that tend to disrupt the communication of the whole network. It has two phases and the first phase is the election phase. The second stage is the previously elected QDS nodes distribute the tasks to the other nodes. This algorithm turns out to be distributed which is good for sensor networks. There is no use of any global communication or long-range, high energy data communication, but just local communications. This also helps to save power and energy for long life of the sensors. This algorithm is also very scalable and fault tolerant. We have done significant simulations to verify our QDS concepts. There are some metrics that are used to evaluate our schemes such as the average energy values of all the nodes in the network, minimum energy of all the nodes in the network, total energy consumed in the awake, transmit, and receive states, maximum time spent by any node in electing a new QDS, number of elected QDSs, and so on. Our simulations have shown satisfactory energy-efficiency of our algorithms

OLSRp: predicting control information to achieve scalability in OLSR ad hoc networks

Scalability is a key design challenge that routing protocols for ad hoc networks must properly address to maintain the network performance when the number of nodes increases. We focus on this issue by reducing the amount of control information messages that a link state proactive routing algorithm introduces to the network. Our proposal is based on the observation that a high percentage of those messages is always the same. Therefore, we introduce a new mechanism that can predict the control messages that nodes need for building an accurate map of the network topology so they can avoid resending the same messages. This prediction mechanism, applied to OLSR protocol, could be used to reduce the number of messages transmitted through the network and to save computational processing and energy consumption. Our proposal is independent of the OLSR configuration parameters and it can dynamically self-adapt to network changes.Postprint (published version

A survey on Routing Protocols in Wireless Sensor Networks

In ad-hoc WSN is a collection of mobile nodes that are dynamically and randomly located in such a manner that the interconnections between nodes are changing on a continual basis. The dynamic nature of these networks demands new set of network routing strategy protocols to be implemented in order to provide efficient end-to end communication.  Moreover, such issues are very critical due to severe resource constraints like efficient energy utilization, lifetime of network, and drastic environmental conditions in WSNs. Neither hop-by-hop nor neither direct reach ability is possible in case of WSNs. In order to facilitate communication within the network, a routing protocol is used. In this paper we have carried out an extensive survey on WSN protocols based on structure of network, routing protocol of network & clustering techniques of routing protocols