Search

This paper studies the secure transmission in a multiuser broadcast channel where only the statistical channel state information of the eavesdropper is available. We propose to apply secret dirty-paper coding (S-DPC) in this scenario to support the secure transmission of one user and the normal (unclassified) transmission of the other users. By adopting the S-DPC and encoding the secret message in the first place, all the information-bearing signals of the normal transmission are treated as noise by potential eavesdroppers and thus provide secrecy for the secure transmission. In this way, the proposed approach exploits the intrinsic secrecy of multiuser broadcasting and can serve as an energy-efficient alternative to the traditional artificial noise (AN) scheme. To evaluate the secrecy performance of this approach and compare it with the AN scheme, we propose two S-DPC-based secure transmission schemes for maximizing the secrecy rate under constraints on the secrecy outage probability (SOP) and the normal transmission rates. The first scheme directly optimizes the covariance matrices of the transmit signals, and a novel approximation of the intractable SOP constraint is derived to facilitate the optimization. The second scheme combines zero-forcing dirty-paper coding and AN, and the optimization involves only power allocation. We establish efficient numerical algorithms to solve the optimization problems for both schemes. Theoretical and simulation results confirm that, in addition to supporting the normal transmission, the achievable secrecy rates of the proposed schemes can be close to that of the traditional AN scheme, which supports only the secure transmission of one user.

Many applications of Wireless Mobile Communication are used in military, defense etc .however this type of network have many constraints mainly including power constrains, less range of communication & insecure transmission channel which makes it more vulnerable to attacks .such as sinkhole and black hole attack which hampers the communication by attacking on data traffic and communication links on which packets are routed. The attack which operates by falsely claiming a fresh route to destination is a kind of denial of service is known as Sink hole attack. On the other hand black hole attack, intentionally dropped the incoming packets through malicious node in between the intermediately nodes. In this research paper we can examine and investigate the impact of sink hole and black hole attack on the performance of MANET network using DSR protocol in terms of throughput ,packet delivery ratio over the network.

The Internet of things (IoT) refers to a type of network to connect anything with the Internet based on stipulated protocols through information sensing equipment’s to conduct information exchange and communications in order to achieve smart recognitions, positioning, tracing, monitoring, and administration. In this paper we briefly discussed about what IOT is, how IOT enables different technologies, about its architecture, characteristics & applications. The purpose of this paper is to provide the basic information about IoT for young readers.

We consider a game-theoretic setting of contention in communication networks. In a contention game each of \(n \ge 2\) identical players has a single information packet that she wants to transmit in a fast and selfish way through one of \(k \ge 1\) multiple-access channels by choosing a protocol. Here, we extend the model and results of the single-channel case studied in [2] by providing equilibria characterizations for more than one channels, and giving specific anonymous, equilibrium protocols with finite and infinite expected latency. For our equilibrium protocols with infinite expected latency, all players, with high probability transmit successfully in optimal time, i.e. \(\varTheta (n/k)\).

In this paper, we extend the interference channel with degraded message sets model by introducing multiple secondaries. The new model allows for multiple concurrent transmissions in a wireless network by employing dirty paper and superposition coding. We apply the proposed scheme to the communication between nodes in a wireless mesh network (WMN). The cases of different WMN topologies are analyzed, and numerical results show that considerable capacity gains are achieved when using the proposed model with multiple secondaries.

Although the Domain Name System (DNS) was designed as a naming system, its features have made it appealing to repurpose it for the deployment of novel systems. One important class of such systems are security enhancements, and this work sheds light on their deployment. We show the characteristics of these solutions and measure reliability of DNS in these applications. We investigate the compatibility of these solutions with the Tor network, signal necessary changes, and report on surprising drawbacks in Tor’s DNS resolution.

User interfaces to control networked household appliances are often inadequate. Either they are too simplistic or they are too complex and complicated relying on a PC-based interface. Therefore, a user interface that supports complex functionalities and is easy to use is required. In this article digital pen and paper are presented as a suitable interface. Digital pens are only marginally larger than their traditional counterparts, and digital paper is ordinary paper with an almost invisible unique pattern printed on it. Pen and paper are well known to users and thus an important barrier to the acceptance of networked appliances is removed. The approach is integrated with an open services gateway initiative (OSGi) gateway, thus allowing for flexibility with respect to the protocol used to communicate with the appliance. It is also shown how the approach can be applied to other appliances in and beyond the home

Many datasets change over time. As a consequence, long-running applications that cache and repeatedly use query results obtained from a SPARQL endpoint may resubmit the queries regularly to ensure up-to-dateness of the results. While this approach may be feasible if the number of such regular refresh queries is manageable, with an increasing number of applications adopting this approach, the SPARQL endpoint may become overloaded with such refresh queries. A more scalable approach would be to use a middle-ware component at which the applications register their queries and get notified with updated query results once the results have changed. Then, this middle-ware can schedule the repeated execution of the refresh queries without overloading the endpoint. In this paper, we study the problem of scheduling refresh queries for a large number of registered queries by assuming an overload-avoiding upper bound on the length of a regular time slot available for testing refresh queries. We investigate a variety of scheduling strategies and compare them experimentally in terms of time slots needed before they recognize changes and number of changes that they miss.

Wireless Sensor Network(WSN) is an accumulation of sensors with constrained resources that work together to accomplish a common objective. WSNs are often installed in harsh environments where because of the unattended nature and lack of tamper proof hardware, an attacker can compromise nodes from the network, and can replicate these captured nodes to many clones using original node’s parameters like unique ID and hence, easily gaining control over the whole sensor network. The proposed clone detection protocol is an efficient approach which easily detects clones in static Wireless Sensor Networks. It is a witness-based approach where some nodes from the network are randomly selected to increase randomness of the network resulting in increased detection probability of the clones. The proposed approach successfully detects the clones which have forged both unique ID as well as location overcoming the shortcomings of existing approach.

An alternative computing paradigm is explored in this letter with application to wirelessly powered Internet of Things (IoT) devices. Contrary to existing methods that rely on DC computing, the wirelessly harvested AC power is directly used for computation by leveraging charge-recycling theory. The proposed approach has the potential to significantly reduce the energy cost, one of the primary barriers that slows down the global scalability of IoT devices. This opportunity and related challenges are investigated in this letter to provide guidelines for future research in the field.

Cloud computing is an information technology paradigm model which offers clients access to shared pool of resources. Replication and division of data takes into consideration the performance and security issues. A given file is divided into fragments and then replicated. They are placed over the nodes (servers) and every node stores a single fragment of data in order to improve security. The nodes that store the replicas and fragments are not adjacent to each other by applying T-coloring method hence preventing the attacker from gaining access to useful information. The user can download the file from anywhere but has to specify the exact location as well as the time and date in order to get maximum security as compared to other systems. The likelihood of finding andcompromising the nodes that store the fragments of a file is very low.

A wireless sensor network(WSN) is usually composed of a large collection of small autonomous sensor device that can sense environmental condition about the ambient environment. The main task of wireless sensor node is a communicate together by many wireless strategies. In this communication strategies need fast data access in wireless sensor network(WSN), as resource constrained is a main issue in wireless sensor networks applications. For this solution administered routing protocol. Routing protocol are in charge of discovering and maintaining the route in the network. Routing protocol with low energy consumption play a very important role in prolonging the lifetime of sensor network. Cluster based routing protocols have proven to be effective in network topology management, energy minimization and data aggregation and so on. In this paper we present various clusterbased routing protocols and merits and limitations of protocols.

Small area femtocell increases the energy efficiency of the cellular network as the distance between base station and user is very less. Mobile femtocell causes the spectrum reuse to be used at very large extent making spectral efficiency suffer. This paper discusses recently researched techniques that have been used to increase the spectral efficiency in mobile femtocell network. But these techniques also come with their own limitations. Considering this, data aggregation and compression technique can be consider as one of the best contender to increase the spectral efficiency in cellular network which is also been explained in this paper.

A descriptive guide to develop smart sensor nodes for Internet of Things (IoT) application has been presented in the paper. The current technology of low-power wide area network (LPWAN) which transmits data with low power consumption over a wide area has been illustrated in the scope of this project. An overview of the transition of IoT devices from a limited range personal area network to wide area network is justified. A sensor node has been developed and tested to validate the implementation of a LoRa network, which can be an exemplar for sensor nodes for various applications.

© 2018 IEEE. Recently, it has been standardized by the 3rd Generation Partnership Project (3GPP) [1] that device-to-device (D2D) communications should use uplink resources when coexisting with conventional cellular communications. With uplink resource sharing, both cellular and D2D links cause significant co-channel interference. In this paper, we consider a D2D mode selection criterion based on the maximum received signal strength (MRSS) for each user equipment (UE) to control the D2D-to-cellular interference. Specifically, a UE will operate in a cellular mode, if its received signal strength from the strongest base station (BS) is larger than a threshold β; otherwise, it will operate in a D2D mode. Furthermore, in our study, cellular UEs, D2D transmit UEs and D2D receiver UEs constitute the entire UE set, which is a more practical assumption than dropping more UEs for D2D reception only in existing works. The coverage probability and the area spectral efficiency (ASE) are derived for both the cellular network and the D2D one. Through our theoretical and numerical analyses, we quantify the performance gains brought by D2D communications and provide guidelines for selecting the parameters for network operations.

Software Defined Networking (SDN) was introduced with a philosophy of decoupling the control plane from the data plane which facilitates network management while ensuring programmability in order to improve performance and monitoring. OpenFlow which enabled SDN was first introduced to match twelve header fields whilst at current it matches forty one which is expected to grow exponentially. Therefore future networks must have the ability to flexibly parse packets through a common interface. Programming Protocol independent Packet Processing (P4) was introduced to achieve the aforementioned by programming the underlying switch, providing instructions and utilizing APIs to populate the forwarding tables. A P4 programmed switch will forward packets through a parser into multiple stages of match+action tables to find the destination node which is considered the most efficient mechanism for routing. This paper takes into the account the latest platform developed for service providers, Open Networking Operating System (ONOS) to deploy two environments configured in the aforementioned technologies in order to test their performance. Four case studies were drawn which were simulated in Mininet which incorporated SDN + P4 switches. A significant increase of performances were recorded when compared with the performance of cases using SDN only.

Bitcoin provides freshness properties by forming a blockchain where each block is associated with its timestamp and the previous block. Due to these properties, the Bitcoin protocol is being used as a decentralized, trusted, and secure timestamping service. Although Bitcoin participants which create new blocks cannot modify their order, they can manipulate timestamps almost undetected. This undermines the Bitcoin protocol as a reliable timestamping service. In particular, a newcomer that synchronizes the entire blockchain has a little guarantee about timestamps of all blocks. In this paper, we present a simple yet powerful mechanism that increases the reliability of Bitcoin timestamps. Our protocol can provide evidence that a block was created within a certain time range. The protocol is efficient, backward compatible, and surprisingly, currently deployed SSL/TLS servers can act as reference time sources. The protocol has many applications and can be used for detecting various attacks against the Bitcoin protocol., Comment: In Proceedings of Crypto Valley Conference on Blockchain Technology (CVCBT), 2018

over Internet protocol (VoIP), which is a communication protocol existing over a network. The IP network can makes it possible for users to make telephone calls using the VoIP technology. Use of VoIP and Internet telephony has increased significantly in the recent years. These new phone services are based on the transmission of voice over packet switched IP networks. VoIP can be realized on any data network that uses IP, like the Internet, Intranets and Local Area Networks (LAN). VoIP customers use their Internet connection to connect to the Internet as well as to make phone calls. VoIP is the real-time transfer of voice signals using the Internet Protocol (IP) over the Internet or a private network. In simpler terms, your voice is converted to digital signal by VoIP that travels over the internet. The key factors that entice enterprises to switch to VoIP are its flexibility and cost efficiency. Some security problems may arise due to the widespread deployment of VoIP. Voice over IP (VoIP) has the potential to provide interactive communication services like video and voice conferencing. VoIP helps to transfer data which are difficult to transfer over circuit-switched wired and wireless networks.

Wireless mesh networks (WMNs) have emerged as a flexible and low-cost network infrastructure, where heterogeneous mesh routers managed by different users collaborate to extend the network coverage. IEEE 802.11s standard was defined as a wireless mesh network which extends IEEE 802.11 MAC standard. The protocols introduced by IEEE 802.11s draft are divided into Proactive, Reactive or Hybrid categories. This paper aims to improve the routing process of HWMP: Hybrid Wireless Mesh Protocol defined by IEEE 802.11s standard by interworking 802.11s network with LTE network. Also, it aims to make the protocol more reliable by providing the QoS to the network. The pre-defined path selection metric is also enhanced to get more accurate information about the path quality. The proposed contribution aims to provide better performance to the 802.11s-LTE network and enhances the network with delay-aware routing. A simulation study will be conducted under NS-3 to observe the impact of the proposed protocol in offloading mechanism. Finally, the performance of overall contribution is compared to HWMP.

To cope with the growing performance needs of appliances in datacenters or the network edge, current middle-box functionalities such as firewalls, NAT, DPI, content-aware optimizers or load-balancers are often implemented on multiple (perhaps virtual) machines. In this work, we design a system able to run a pipeline of VNFs with a high level of parallelism to handle many flows. We provide the user facilities to define the traffic class of interest for the VNF, a definition of session to group the packets such as the TCP 4-tuples, and the amount of space per sessions. The system will then synthesize the classification and build a unique, efficient flow table. We build an abstract view of flows and use it to implement support for seamless inspection and modification of the content of any flow (such as TCP or HTTP), automatically reflecting a consistent view, across layers, of flows modified on-the-fly. Our prototype gives rise to a user-space software NFV data-plane enabling easy implementation of middlebox functionalities, as well as the deployment of complex scenarios. Our prototype implementation is able to handle our testbed limit of -34 Gbps of HTTP requests (for 8-KB files) through a service chain of multiples stateful VNFs, on a single Xeon core.

With the rapid increase in international roaming and highly growing number of cellular subscribers it is important to locate the subscriber both efficiently and accurately not only to reduce the cost but also to decrease the load on MSC and decrease the paging delay. The procedure used by the service provider for both collecting and analyzing the information regarding the subscribers’ location is called location management. Location management comprises of location update and paging schemes. This paper tried to highlight the different location management techniques and paging schemes that are used in CDMA network. This paper also compares their features, merits and demerits. Finally the paper discusses various techniques that are used in order to optimize the location update schemes by categorizing them into two broad groups’ i.e. static location update and dynamic location update. Each group enlists different techniques that are used to decide the update frequency of MS (Mobile System). This study has tried to summarize their underlying concepts and various pros and cons.

of Agents in the domain of managing traffic and its real time demand of coordination and cooperation is proven quite promising. Agent oriented traffic coordination helps in improving traffic management and in achieving efficiency of vehicle movement. Today with rapid urbanization and increasing number of vehicles traffic congestion has emerged out as a serious bottleneck. Automated vehicle decision models that are capable of taking self-decision finding a better path for the movement of traffic flow in control area are developed and more work is going on this field. These automated vehicles are able to communicate and coordinate with each other's thereby maintaining proper coordination among neighboring vehicles. Every neighbor knows its current location and its group member's. This paper presents several traffic coordination, communication and controlling strategies and methods for controlling them. Use of agents in traffic simulation, helps in reducing traffic congestion and delay. Lack of communication and controlling mechanism decreases traffic speed and average target destination time.

Steganography is the process to hide a secret message such that it is very difficult to detect the presence of secret message presence. On other way, the existence of secret message is hidden. A covert channel may refer to the actual medium that is used to communicate the information such as a message, image as well as file. This project uses steganography within the source address fields of Internet Protocol Version 6 (IPv6) packets to create a covert channel through which clandestine messages can be passed from one party to another. A fully functional computer program was designed and written that transparently embeds messages into the source address fields of packets and across IPv6 networks, embedded messages are by these packets. This demonstrates the covert channel possibility within a default Internet protocol. For a malicious purpose such as stealing encryption passwords as well as keys or other secrets from remote hosts in a sequence not easily detectable this channel is used, but it may be used for a noble cause such as secretly passing messages under the watchful eyes of an oppressive regime. The covert channel demonstration in itself the overall information security of society is increased by bringing awareness to the existence of such a steganographic medium.

Internet-of-Things (IoT) devices, wearables, sensor networks and lately vehicles produce continuous streams of data. Distributing every data item to all interested applications can quickly bring the underlying network to its capacity limits. Moreover, applications are often only interested in the “big picture” derived from aggregates of this data. Hence, data aggregation becomes a necessary step in order to optimize bandwidth utilization. The standard approach to data aggregation is based on a centralized, application-specific method, with gateways collecting the data produced by the various devices and sending it to a central location, where data is aggregated and stored. Aggregation is performed with a specific network and/or application in mind, hence limiting the way this data may be used by other, current or future applications. This approach is also less suitable for applications and networks which are distributed in nature, like in the case of vehicle-to-vehicle communication. To cater for these use cases, we argue the need of in-network data aggregation, agnostic of data location and applications using it. In this paper, we explore an Information-Centric Networking (ICN) approach to in-network data aggregation, because of ICN's philosophy of breaking the dependence of data requesters on particular network hosts. Our demo will showcase how data aggregation can be performed by any ICN node and how it is matched to the requester's requirements, hence allowing applications to obtain personalized data aggregates while still using a generic-purpose networking stack.

Wireless Sensor network (WSN) are broadly used toda y in various fields such as environmental control, surveillance task, object tracking, military applications etc. As WSN is an a d-hoc network which is deployed in such an environm ent which is physically insecure, intrusion detection has been one of the m ajor area of research in WSN. Inorder to achieve an appropriate level of security in WSNs we cannot depend on cryptographic techniques as these techniques fall prey to insider attacks. This paper discusses on watchdog mechanism, one of the intrusi on detection techniques in Wireless Sensor Network. Watchdog is a monitoring technique which detects the misbehaving nodes in the network. The main area of focus in thi s paper is being made to the problems in existing watchdog technique for mal icious node detection.

In Priority-based content processing with Q-routing in Information Centric Networking (ICN), Sibendu Paul, Bitan Banerjee, Amitava Mukherjee and Mrinal K. Naskar address content management issue in a cache with finite storage capability in ICN by proposing an efficient content management policy that changes a router to a self-sustained cache. A novel algorithm based on Q-routing is proposed to determine the order of service for content packets in the buffer of a cache and find next node toward the destination with minimum propagation delay.

market share of existing Smart Grid network installations is wireless mesh networks ( 1). The paper starts by justifying the selection of WMNs as opposed to any other communication techn ology based on quantifying the bandwidth/latency/QoS constraints of a number of Smart Grid applications. The main objective of this paper, however, is to discuss some optimization techniques that found in the literature and can be implemented to overcomesome of the challenges currently being faced by WM Ns deployment in Smart Grid's NANs. Hybrid WMN (HWMN) is proposed as an optimization on the topology level to leverage WMNs convergence. Distributed Autonomous Data Routing DADR, multigate and diversity routing are optimizations on the protocol level to minimize the down time of WMNs. Cognitive Radio is investigated as an optimization on the physical level . The paper also explores the feasibility of using Wireless Software DefinedNetworks WSDN to improve the overall visibility and manageability of WMNs.

Energy is an important issue in MANET (Mobile Ad hoc Network). Nodes in network are working in presence of limited energy. So, energy efficient routing is needed for reducing energy consumption. Energy efficient routing schemes can greatly reduce energy consumption and extends the lifetime of the networks. Multipath routing protocol (AOMDV) having more than one path, if the first one is break then second provides the proper packet delivery, this causes reduced node energy consumption and the topology of MANETs always changes, due to the high mobility of nodes. This makes it more difficult to find the routes that message packets use when they are routed. The location based routing provides the location information of the destination to route a packet toward. This paper provides comparison and study on reduced energy consumption by using multipath protocol and performance which is evaluated by performance metrics in case of AOMDV and energy based AOMDV. Now here DREAM protocol is used with AOMDV to finding location of mobile nodes but not with energy but here measures their performance with both multipath protocols. I. INTRODUCTION A mobile ad hoc network (MANET) is a dynamic distributed system of mobile formed by means of multi-hop wireless communication without the use of any existing network infrastructure. MANET routing protocols can be classified into two classes. Proactive protocols, they requires the nodes to periodically exchange the table information to update the pre-determine routes between any pair of source destination nodes. Reactive protocols can establish routes only when they require. MANET routing protocols can be classified on the bases of the methods of delivery of data packets from source to destination. Single Path routing protocols learn routes and select a single best route to each destination. These protocols are incapable of load balancing traffic. Multi-path routing protocols learn routes and can select more than one path to a destination. These protocols are better for performing load balancing. This paper provides the comparison between results about Multipath routing in AOMDV (13), AOMDV with location and Energy with AOMDV.

The field of Adhoc Network has gained an important part of the interest of researchers and become very popular in last few years. Adhoc network can operate without fixed infrastructure and can survive rapid changes in the network topology. They can be studied formally as graphs in which the set of edges varies in time. In this paper, we analyse the performance of three protocols AODV, DSDV OLSR. The performance of proposed networks are evaluated in terms of packet delivery ratio with the help of NS-3 simulator. In this paper, OLSR shows better performance over the other two protocols, that is DSDV and AODV.

A mobile ad hoc network (MANET) is a collection of autonomous nodes or terminals which communicate with each other by forming a multi-hop radio network without the aid of any established infrastructure or centralized administration such as a base station. It is composed of tiny wireless sensor nodes which are mobile and dynamic nature. Due to mobility, when nodes re communicate to each other, they easily loss their energy or we can say the network life time will reduce by time. To maintain the energy efficiency of any node or network, some protocols are developed. The size of network depends on the total number of nodes in network. When size of network expands it means numbers of nodes are increases. This paper presents how life time of network can be increased by increasing number of nodes using EEP protocol. This work presents the improvement over LEACH protocol.