Search

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.

Wireless sensor network are widely used in different area application, especially in the field of surveillance and monitoring tasks. So for the implementation in practical life many constraint and challenge arise. In the present paper we are focused on one of main such constraint called deployment of sensor node for better coverage. In this paper we review on the different techniques on deployment like artificial bee colony, particle swarm optimization, genetic algorithm, artificial immune system and compare them on different aspects like complexity, scalability, region of interest, suitability to static or mobile wireless sensor network and applicability to multiple objective etc. We also present pseudo codes for each planned algorithm.

In many networks there is a necessity to transmit data packets flows, the intensity of which exceeds the throughput of one channel SpaceWire, GigaSpaceWire, SpaceFibre. This flow can be a packet flow from a single source to a single destination, for example, from a camera to a monitor. Also, a packet flow can include packets from different sources to different destinations that goes via two neighboring routers. An example is transmission of packets between two routers located on the boundaries of neighboring regions. The packets, belonging to one flow can have almost same length (transmission of uncompressed video), or quite different length (transmission of compressed video, transmission of packets with different content between two regions). The adaptive routing can be used for transmission of such packet flows. This mechanism includes in SpaceWire standard. A set of alternative output ports (a group of ports) can be determined in routing table for the logical (or regional address). Any output port from this group (if connection for this port is established and port is not occupied by other packet) may be used for transmission of packet with this address. Thus, the summary throughput of all ports belongs to the group can be used for transmission of data packets with this address. However, the possibility of parallel transmission of packets from this flow to different output ports belongs to the group is required for effective utilization of this summary throughput. If the length of packets may be different or if the quantity of input ports for considered flows is not equal to the quantity of output ports in the group, the router should include special mechanisms to ensure efficient parallel transmission of packets to all ports belongs to the group. Adaptive routing for intensive data flows transmission can be implemented not only in SpaceWire/GigaSpaceWire networks, but also in SpaceFibre networks. We consider the specific of its implementation taking into account the features of data link layer (virtual channels with a fairly large buffers, retry mechanism) In this paper we discuss possible implementations of these mechanisms for SpaceWire, GigaSpaceWire and SpaceFibre, estimate achievable bandwidth utilization of port's group, the overhead of the implementation of these mechanisms for packets flows with different characteristics. A side effect of adaptive routing is a possible mismatch of the order in which packets are sent to the network form the source and the order of their receipt by destination. We evaluate the packet's window size that required in the destination node for recovery order of packets and the associated delays. The ports of router belonging to the same group may be connected to one or several different routers (according to the standard). In the first case all packets from the flow will be transmitted via one chain of routers (via one path via network). In the second case, they will be transmitted through the network in different ways. The reordering of packets is possible in both cases. However, in the first case, the mechanisms, that prevent the packets reordering, can be implement in routers. But its implementation can lead to decrease of throughput utilization, to additional hardware costs and to increase of packet's transmission time. In the paper we estimate these overheads for data packets flows with different parameters.

The paper presents analysis and comparison of Quality of Service (QoS) mechanisms in SpaceFibre draft H4 and in RapidIO rev 4.0. SpaceFibre and RapidIO standards are currently used in aerospace instrumentation field. SpaceFibre standard is developed by ESA, JAXA, NASA, ROSCOSMOS agencies for aerospace industry in accordance to different requirements and limitations such as a high speed data transmission, a low data transmission time, a guaranteed packet delivery, a guaranteed throughput, a possibility to establish real-time systems in conjunction with compact VLSI design and low energy consumption. RapidIO standard is developed for a high performance computing systems with a globally shared distributed memory (GSM) model. At the present time NASA applies this standard as a main standard for aerospace field. These standards provide data transmission with different QoS. In these standards there is a feature of guaranteed packet delivery, they support several priority levels. Also they provide a mechanism of virtual channels allowing to distribute throughput between different data streams. In this paper authors have presented the information about comparison QoS mechanisms of SpaceFibre draft H4 and RapidIO rev 4.0. Moreover similarities and differences of supported technologies are demonstrated. Also author have evaluated the reachable characteristics of data transmission and overheads for each standard. Advantages and effective range of application of SpaceFibre QoS are shown.

Satellite onboard control systems have changed significantly towards of complexity of control algorithms. Network operation must be flexible and adapt easily to configuration and composition changes of the onboard network. Plug-and-Play should solve this problem. Plug-and-Play technology is aimed for network monitoring, should promptly detect changes in it and correctly handle any network situation. Due to size increase of onboard networks, one center (Plug-and-Play Manager), which would quickly react to changes in the entire network, is not enough, one must have several such centers. Thereby there is the problem of Plug-and-Play manager's placement in the network, to provide rapid response and efficient management of other devices in the network. Depending on the SpaceWire network functions and requirements, it must be taken into account in its design, in determining position for the Plug-and-Play managers. In the paper, we consider some reference variants of SpaceWire/GigaSpaceWire networks: • Network designer chooses the number of Plug-and-Play managers according to the network size and others parameters. The network is not clustered, not divided into subnetworks. • Network designer chooses the number of Plug-and-Play managers according to the network size and others parameters. However, the network that is initially undivided into subnets, in the search for of the network managers location is divided into subnets. • Network designer clusters the network, divides it into subnets. For each subnet, the manager's placement problem is solved separately in accordance with the requirements to particular subnet. In this paper, we will consider in details two approaches to determining location of Plug-and-Play centers in SpaceWire/GigaSpaceWire networks. The first approach is based on a method of graph partitioning into subgraphs. The second approach is based on a P-median graph search algorithm. Both approaches are described in details. Advantages and disadvantages of these methods will be presented; their computational complexity will be evaluated. In network managers placement it is important, what will be characteristics of data transfer from Plug-and-Play managers to nodes. These characteristics include data transmission time, data transmission delay, etc. It is important how the network nodes are distributed among the Plug-and-Play managers for control. The network managers loading should be as uniform as possible. All these parameters directly affect the quality of the Plug-and-Play technology. We assess transmission characteristics between the Plug-and-Play manager and network nodes for each of these approaches, give recommendations of using these approaches for Plug-and-Play managers placement, taking into account various features of the construction and administration of SpaceWire/GigaSpaceWire networks.

SpaceWire is valuable because it facilitates the development of spacecraft subsystems such as payload instruments, mass memory, and onboard computers. On the other hand, it takes much time and effort for developers to configure an initiator of the SpaceWire network because they have to take account of the entire SpaceWire network in a spacecraft. As the target network becomes larger, the path addressing and the packet collision-free timeslot allocation are harder for the developers to configure. Furthermore, the configuration tables of the initiator should satisfy various constraints, such as the bandwidth limitation and priority of specific packets. These constraints are different in each spacecraft. In order that the developers can design the large-scale SpaceWire network efficiently, automatic configuration table generation under the constraints is indispensable. This paper presents a constraint-based configuration table generator (CTG) that automatically provides reliable redundant path routing and collision-free timeslot allocation for required transactions in the target topology. We apply a constraint solver to the CTG to set many kinds of user-defined constraints in the network. For example, the bandwidth limitation, priority of the packets, and other various constraints can be easily inputted into the CTG. The CTG automatically generates configuration tables satisfying these constraints. Additionally, the CTG reports network topology views with bandwidth utilization ratios. This helps developers to verify whether a generated configuration is just as designed. The CTG can also notify developers that their requirements cannot be solved. In this paper, we show the feasibility and effectiveness of this tool through evaluation using a large-scale SpaceWire network case.

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.

Wireless sensor networks consists of sensors nodes used for the communication purpose. Wireless sensor networks are self-organized and data-centric. In Wireless sensor networks, there are some issues like data redundancy, high energy conservation and injecting unnecessary data. Data aggregation method overcomes the data redundancy problem. In this paper, a data integrity protection strategy has been discussed based on watermarking technologies to protect the data integrity. At the end of the paper comparison of various schemes is also provided based on characteristics like the method adopted by each scheme and the position at which integrity is provided.

Mobile Ad hoc network is network where nodes communicate without any central administration or network structure. They are interconnected through wireless mediums and can use multiple hops to change data with them. Routing protocols are required for communication and synchronization in such Ad hoc networks, where it targets efficient and timely delivery of message. The DSR is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network without the need for any existing network infrastructure or administration.

Software defined network (SDN) made with basic concepts that are different from traditional networks in controlling the network, the separation between the control layer and forwarding layer on different devices allows the administrator to adjust the control plan for all devices centralized in one action, while in traditional network, the control and forwarding layers are located in the infrastructure making network administrator must manage devices one by one. Research using single board computers on network technology provides an opportunity to implement SDN architecture. Raspberry Pi has sufficient ability. QoS results meet the ITU-T G.1010 reference which indicates that Raspberry Pi can be used on designed networks.

A WSN is a specialized wireless network made up of large number of sensors and at least one base station. The foremost or the main difference between WSN and the traditional wireless networks is that sensors are extremely sensitive to energy consumption. Energy saving in the crucial issue in designing the wireless sensor networks (12)... Since the radio transmission and reception consumes more energy, one of the most or the main significant issue in wireless sensor network is the inherent limited battery power within network sensor nodes. It is preferable to dispense the energy throughout the wireless sensor network so to maximize the lifetime of sensor nodes. So it is essential to design effective and energy aware protocols in order to enhance the life time of the network. A wireless sensor network may have network structure based or protocol operation based routing protocol. In this paper, a review on hierarchical based routing protocol which is further a sub-type of the network structure based routing protocol in WSNs is carried out. Major issues which are considered in WSNs are Energy consumption and network life time.

Mobile wireless local area networks (WLANs) are becoming popular. Mobile WLANs can be composed of WiFi devices such as portable access points (APs) and portable terminals such as smartphones, tablets and any tethering devices. Several mobile WLANs are densely deployed in a conference room or cafe. In this case, the WLANs have to share available channels even though they suffer from interference. The interferences coming from the same channel (intra-channel contention) or a different channel (inter-channel interference) reduce the total throughput of the WLANs. This paper investigates the throughput characteristics of several densely deployed WLANs for multimedia communications. For experiments using real machines, for example, 18 sets of WLANs, the relationship among the number of WLANs, distance of WLANs, channel assignment and total throughput was revealed. Moreover, it is shown that the number of terminals in each WLAN substantially affects the total throughput because of the nature of the multi-rate and sending opportunity fairness in CSMA/CA or a performance anomaly.

Wireless sensor network is vast area for research. Because of scarce resources, energy consumption and battery lifetime is crucial aspects in WSN. So with the help of routing protocol, improvement can be done. More energy can be conserved and network lifetime can be improved by modifying the existing protocols. Power Efficient GAthering in Sensor Information System (PEGASIS) is an improvement of hierarchical protocol. It mainly focuses on network lifetime. It uses chaining construction and data gathering approach to communicate. Aggregated data will pass on to the head node and it will pass the data to the base station. This paper introduces the PEGASIS, discusses the related previous work. New aspect of PEGASIS in heterogeneous environment is proposed. The new scheme is proposed in order to conserve energy.

Internet Protocol version 6 (IPv6) signifies the latest version of IP, the ‘Internet Protocol’. The communication protocol allocates an identification, as well as a location system of computers on the network. One of the key protocols in IPv6 is the neighbour discovery protocol (NDP). The NDP covers many functions including the discovery of nodes on a similar link, the detection of addresses that are duplicate, and the detection of routers. Due to the importance of NDP, it makes it susceptible to several attacks including denial of service (DoS); ‘Denial of Service’ attack. Many mechanisms proposed to secure NDP. However, these mechanisms are still vulnerable. This paper reviews the significance of NDP and presents the advantage and disadvantage of each proposed mechanisms. Moreover, the SeND mechanism was implemented and the results were compared with the original NDP. This paper discusses the requirements of features of the proposed mechanism in securing the IPv6 NDP processes.

International audience; IEEE 802.15.3 High data rate wireless personal area networks (HDR WPANs) have been developed to communicate with devices within 10 m at high speed. A mesh network made up of a parent piconet and several child piconets can support multi-hop communications. Wireless mesh networks (WMNs) have been expected to be the ultimate solution for the next decade wireless networking, showing rapid progress and many new inspiring applications. The international standardization organizations formed working groups to address the problem of standardization for WMNs. These groups were the IEEE 802.15.5 (mesh extensions for WPANs),the IEEE 802.11s (mesh extensions for WLANs), and the IEEE 802.16a (mesh extensions for WiMAX). The IEEE 802.15.5 standard is the standard which defines specifications for including multi-hop functionality in the legacy 802.15.3 and 802.15.4 low data rate (LDR) WPAN networks. The impetus for a WPAN to operate in a mesh topology is to increase the network coverage without increasing the transmit power, to increase the route reliability via route redundancy, self-configuration, and efficient use of device battery life. In the case of meshed WPANs, multiple WPAN clusters compete for channel time in a shared superframe. Therefore, it is essential to determine the channel time requirements of each cluster with a certain number of devices and to determine how these clusters can compete to the shared channel time. In this paper, we investigate the different resource allocation mechanisms related to the meshed HDR WPANs for the 802.15.3 and the 802.15.5 standards. We introduce the single hop and the multi-hop IEEE 802.15.3 WPAN architectures. This is followed by the introduction of the IEEE 802.15.5 standard that provides the mesh capabilities for extending the coverage area of HDR WPANs. The current on-going research issues for resource allocation, including beacon interference, reservation collision etc., in both meshed 802.15.3 and 802.15.5 are alluded to.

Computer security professionals have used passive network countermeasures for several years in order to secure computer networks. Passive countermeasures such as firewalls and intrusion detection systems are effective but their use alone is not enough to protect a network. Active countermeasures offer new ways of protecting a computer network. Corporations and government entities should adopt active network countermeasures as a means of protecting their computer networks.

SpaceWire is integrated networking technology where the data packets and control traffic in the form of hard real-time signals are transmitted throw the same links of communication network. Last decades for hard real-time signals transmission in onboard networks the specialized buses like CAN and MIL-STD 155b and sideband signals were used. All buses have the property that the signal from the source node to all other nodes propagates simultaneously, so there is no jitter for signal delivery. When the industry moves to a common communication medium for control and data traffic transmission through network with routing switches and point-to-point connections, there is a problem of synchronization hard real-time signals delivery from the source to all other nodes because of different distance (number of switches and link speeds in a path) between source and receiver. There are many different algorithms and methods for the system time synchronization. In this paper we consider the questions of delivery synchronization of distributed interrupts which intended to control and inform the devices about critical system events in hard real-time.

In Service-Oriented Architecture (SOA), dedicatedintermediate nodes called load balancers are usually deployed in data centers (DC) in order to balance the load among multiple instances of an application service and to optimize the resource utilization. However, the addition of these nodes increases the installation and operational cost of DCs. These load balancers distribute incoming flows to multiple outgoing ports usually by hashing them. Several techniques are used in order to select the outgoing ports e.g. round robin, queue length, feedback from neighbors etc. Such load balancing approaches do not considergetting live feedback from the service end and therefore are not able to dynamically change the amount of allocated resources. In this paper, a distributed load management scheme isproposed for service oriented networks based on the currentInternet architecture. In this scheme, lightweight interconnected management agents are used to decide the availability for a particular service instance and help in optimal distribution of the flows. The proposed scheme can also be applied in other emerging internetworking architectures such as RINA.

SpaceWire-D is an extension to the SpaceWire protocol that provides deterministic capabilities over existing SpaceWire equipment. The network is divided into segments using a virtual bus abstraction, where a virtual bus consists of a single RMAP initiator, one or more RMAP targets and the SpaceWire links that make up the paths between the initiator and the targets. Time-codes are broadcast periodically to provide time-division multiplexing, and a network schedule is defined by the allocation of virtual buses to time-slots. If a virtual bus has been allocated a time-slot, it is allowed to execute transactions to any of the targets within the virtual bus as long as the transactions complete their execution before the end of the time-slot. If the schedule is designed so that no virtual buses sharing a link are allocated the same time-slot, packets are no longer affected by blocking which allows the transaction execution times to be calculated and real-time constraints to be satisfied. The SpaceWire-D demonstration system has been designed to facilitate the verification of the draft standard. It consists of two RMAP initiators, twelve RMAP targets, a network manager device, a host PC and a routed SpaceWire network to connect the devices together. The LEON2-FT based initiator boards each contain an embedded SpaceWire-D software layer and an automated test scripting system, built on top of the RTEMS real-time operating system. The target boards respond to RMAP commands and provide event notification functionality on the backplane to allow for network activity monitoring. The network manager receives statistics and error information at the end of each schedule epoch, reported by the initiators, and informs the host PC so that it can be read, parsed and displayed to the user. Finally, the host PC runs a suite of software programs to configure, control and monitor the other devices in the demonstration system. This paper provides an overview of the SpaceWire-D protocol and describes the design and features of the SpaceWire-D demonstration system.

As a switched network, SpaceWire can easily connect SpaceWire nodes together to realize parallel data communication, which can not only contain spacecraft interconnection between independent equipment, can also be used as “virtual backplane” to achieve mutual connection and communication between avionics internal hardware modules. However, SpaceWire nodes using asynchronous parallel operation mode are prone to causing network congestion, which is not conducive to the balance of network bandwidth. In this paper, a method of using the driver table between existing all-purpose interface controller of hardware module and SpaceWire node controller is implemented based on the SpaceWire-D protocol, to achieve deterministic SpaceWire network communication management. SpaceWire node send data to or receive data from the allowed nodes within the predefined time interval according to the information in the driver table, reaching the goal of deterministic communication and network flow optimization. In addition, through global communication time planning, when the processor module in certain avionics equipment fails while other hardware modules is still functioning, only the routing table in the SpaceWire router need to be reconfigured to complete the takeover of hardware module inside faulty equipment, without changing communication driver table information, thereby achieve the goal of distributed control.

This paper presents the approach used by the BepiColombo data management subsystem and its SpaceWire network to handle system resets following major anomalies and to ensure availability of communication with the payload and platform units. The system autonomy requirements are presented with a discussion on how they drive the robust implementation of the data management subsystem. Two on-board SpaceWire networks are presented accompanied by an overview of the SpaceWire links, the link failure scenarios, and a description of the functions needed to manage the network. The network management functions are mapped to specific nodes in the SpaceWire network which enables the data management subsystem to initialize the network, detect failures, perform recovery actions, ensure network availability for critical nodes; and that the data transmission performance is acceptable with specific protection against excessive data transfer to the on-board computer. The role of each unit in the SpaceWire network and their contribution to the overall data management subsystem is described.

Deterministic behavior is an important paradigm for verification and validation of real-time systems such as those on crewed space vehicles and robotic spacecrafts. Providing deterministic characteristics of the data transfer for the spacecraft that uses the SpaceWire technology is an essential problem, especially for autonomous vehicles like satellites. Deterministic data delivery guarantees that transmission of data from one node of the onboard network to the target node would not take longer than the specified time period. Such task is solved by using specific communication protocols that include a scheduling service. Modern space industry demands a protocol running over SpaceWire, which can provide deterministic data transmission characteristics. The scheduling problem becomes more complicated, when we consider a number of communication protocols simultaneously operating in every node of the network, e.g. RMAP, STP-ISS, CCSDS PTP. Traffic from different transport protocols can interfere especially while getting access to the SpaceWire link in a node. The paper presents Multiprotocol Scheduling Service — a new scheduling protocol for SpaceWire networks which provides deterministic data delivery in a network and performs arbitration of data coming from several transport protocols. Firstly, we give an overview of TDMA-based network protocols that have been developed for the ground-based and onboard networks. Then, we present Multiprotocol Scheduling Service which is based on the STP-ISS scheduling mechanism and extended with additional features.

There are several standardized protocols based on SpaceWire which provide data exchange between several nodes. SpaceWire is also suitable for interprocess communication (IPC), by the help of higher level protocols. However, currently there is no standardized protocol which is targeting IPC on SpaceWire networks. This paper proposes a protocol, which uses the capabilities of SpaceWire to build up networks for distributed computing on a spacecraft. The core of this protocol is the IPC mechanism for communication between the nodes and methods to support a reconfiguration of the network. A key feature of this protocol is an interface for a reconfiguration mechanism, which can be implemented on application level. This enables the utilization of unreliable commercial off the shelf (COTS) nodes, allowing system recovery from erroneous state. Additionally, the reconfiguration can be used to adapt the distributed computer to different mission phases. The protocol has the potential to build the foundation of a distributed on-board computer consisting of COTS components. Such distributed computer could be capable of fulfilling high performance demands as well as high reliability needs. Though, the protocol itself is not restricted to be used solely in fully-featured reconfigurable distributed systems. The IPC methods can be applied stand-alone as well, to establish a lightweight communication between nodes on a SpaceWire network by excluding the reconfiguration parts of the protocol.

Modern and prospective spacecraft data system networks consist of many systems and sensors producing streaming traffic. Outside spacecraft video cameras also generate intensive data streams. Motion video traffic requires specific latency and speed. Video frames should be delivered with small delays and jitter over high-rate SpaceFibre networks. The paper considers live streaming video over onboard spacecraft networks with its fixed packet size and periodical issue, detection of packet reordering, small delays. ARINC-818-2 and CCSDS Digital Motion Imagery streaming traffic, characteristic of video streams are analysed, requirements for streaming services and transport protocol are presented, the overview of existing streaming protocols is done. The STP-2 protocol was proposed for streaming data service in SpaceFibre networks. It is based on STP, which provides a number of native streaming features. STP-2 has some significant modifications that improve delivery of streaming data flows over high-rate SpaceFibre networks. Use cases for it application illustrate its benefits.

This paper reviews various optical switch technologies, then discusses how to realize an optical circuit switching interconnect capable of more than 10 Tbps link bandwidth and more than 100,000 end points scalability for datacenters or high performance computers. Introducing the wavelength division multiplexing transmission technology and a simple distributed-like control scheme of optical switches is proposed, with the associated challenges discussed.

Modern broadband wireless networks support application mixes, with different, possibly complex, application/user Quality of Service/Experience (QoS/QoE) metrics. The central problem underlying resource allocation for such systems is realizing QoS/QoE trade-offs given the dynamic loads and capacity variability they would typically see. The paper explores a framework for context-aware scheduling based on: (1) context-aware flow classification and management, and (2), complementary base station scheduler. Motivated by typical flow-size distributions for current traffic and characteristics of the associated delay optimal (Gittins index-based) schedulers we propose a novel flow and channel-aware scheduler which meets our design objectives. Using a combination of analysis and simulation we explore the achieved QoS/QoE trade-offs across a dynamic mix of traffic, in particular: 1) mobile web browsing and small file delays; 2) stored streaming video quality vs re-buffering; 3) throughput of larger file downloads. They suggest improved QoS/QoE tradeoffs vs traditional proportionally fair schedulers and are robust to the network load.

Software-Defined Networking (SDN) is a brand-new networking technology which promises to provide flexible architecture and power features. However, performance is always a major concern in deploying SDN. In this paper, we demonstrate how a naive SDN network may suffer from long delay for the first packet in a session, and we propose a "Look Ahead Mechanism" to shorten the delay time. In addition to simulation, laboratory prototypes were implemented to verify the mechanism. The experimental result shows that the delay time can be reduced about 50%, which significantly improves the response time in an SDN-based network.

The Internet of Things (IoT) is a vision for interconnecting all of the world's "things" -- from vehicles to diet scales, smart homes and electrical grids -- through a common set of networking technologies. Realizing this vision using a host-to-host communication paradigm, such as that of the Internet Protocol (IP), is challenging in the context of highly heterogeneous, constrained devices that connect intermittently to one or more networks, often using multiple interfaces, communicate within various security regimes, and require both local and global communication capability. Using IP and similar protocols as the narrow waist of interoperability for IoT requires managing data exchange and security in terms that are largely orthogonal to application semantics, while simultaneously needing to minimize resource usage. This paper explores how Named Data Networking (NDN), a proposed future Internet architecture, addresses the root causes of these challenges and can help achieve the IoT vision in a more secure, straightforward, and innovation-friendly manner. NDN's data-centric communication model aligns network and application semantics, enabling developers to work with "things" and their data directly, and for IoT networks to be deployed and configured easily. To substantiate the high-level discussion, we give examples of ongoing design and implementation work in IoT over NDN and compare the architecture to well-known existing protocols and frameworks. Finally, we discuss short-and long-term scenarios for employing NDN to enable the Internet of Things.

MANET finds many advantages over the wired networks, however it still has some security problems which affects network in many ways. Till now a lot of work has been performed in identifying and solving these issues. In this paper we will be discussing attacks on the network layer of the protocol stack and the existing solutions to these issues.

The sensor nodes deployed in wireless sensor networks are extremely power constrained, so maximizing the lifetime of the entire network is mainly the area of research in recent years. Excess extent of energy is dissipated during data transmission to the base station (sink) from normal sensor nodes. Clustering is an effective approach for organizing a network into a connected hierarchy, load balancing, and prolonging the network lifetime. Different protocols and techniques have been investigated for clustering. This paper presents a brief idea regarding the use of MIMO schemes based on clustering. The efficient use of LEACH protocol and fuzzy logic technique has also been discussed..

Spoofing makes the task of identification and tracking back of the perpetrator / initiator in Cyber Crimes very difficult, e.g. the attacks by way of changing its network identifiers in WLANs. In such a scenario, spoof detection methods have gain wide attention. One way to prevent from spoofing is to authenticate the frames. However, in 802.11 WLANs, authentication and encryption for management and control frames is not provided. Further, present MAC spoofing detection techniques bring out large number of false positives. This paper discusses the various spoofing detection methods. Each method has its own pros and cons and provides a different level of security ranging from low to high. By analyzing the different detection techniques together, it is brought out in the paper as to which particular method could be more suitable in a particular scenario and how one can easily get the reduced false positives. As a study, performing a Session Containment attack by spoofing the IP address of the access point (AP) is also presented and detection of the attack is done using sequence number analysis method. By way of retrospect, an outline of future work is also suggested in the concluding remarks.

Nowadays, Wi-Fi is a very popular Technology. Faster data transfer and Security both are very important for Wi-Fi. At present, Advanced Encryption Standard (AES) is used for Wi-Fi that is more secured than other encryption algorithms but it is not so fast because of it's complex functions. On the other hand, Blowfish is a very faster encryption algorithm but it cannot apply on Wi-Fi because of it's security problems. In this paper, a hybrid algorithm of Blowfish and Rivest Cipher 6 (RC6) is proposed that solves the security problems of Blowfish and also maintains the fastness of Blowfish and makes it able to use it in place of AES. It uses two innovative criteria. One is ingenious confusion process using two random numbers "a" and "w" that removes reflectively weak key attack and Known plaintext attack of Blowfish. The other is usage of one S-Box by overlapping process that eliminates the collision key attack of Blowfish. Sub key generation process of this algorithm also removes the Brute Force attack of AES. This paper tries to give an efficient algorithm that enhances the performance of Blowfish algorithm by adding a function of RC6 with it. The adding process is trickily handed here that makes the proposed algorithm as fast as Blowfish and also secured like existing AES. The proposed algorithm takes less encryption –decryption time like Blowfish and also secured like AES. Throughput, Average time for different data lengths and attack removal process are used to measure the efficiency of this proposed algorithm.

Next-generation 5G concepts are driving infrastructure providers to enable novel services for network operators, such as Virtual Network Function (VNF) and Network Function Virtualization (NFV). Inside a single infrastructure provider, several solutions are available to satisfy the 5G requirements using Software Defined Networking (SDN). However, emerging industry verticals require geographically-distributed services spanning multiple infrastructure providers. In this multi-provider context, additional complexity emerges to guarantee inter-operability. The orchestrator of each multidomain infrastructure (i.e., MDO), is emerging as the key element to offer services to a federation of infrastructure providers. In this scenario, the procedures for establishing inter-provider services are still an open research topic. This work proposes and evaluates two different procedures to enable multi-provider connectivity service exploiting distributed communication among MDOs. The two procedures are evaluated by means of simulations in a federated multi-provider network based on the Elastic Optical Network technology.

Previous research on sensor network security mainly considers homogeneous sensor networks, where all sensor nodes have the same capabilities. Research has shown that homogeneous ad hoc networks have poor performance and scalability. The many-to-one traffic pattern dominates in sensor networks, and hence a sensor may only communicate with a small portion of its neighbors. Key management is a fundamental security operation. Most existing key management schemes try to establish shared keys for all pairs of neighbor sensors, no matter whether these nodes communicate with each other or not, and this causes large overhead. In this paper, we adopt a Heterogeneous Sensor Network (HSN) model for better performance and security. We propose a novel routing-driven key management scheme, which only establishes shared keys for neighbor sensors that communicate with each other. We utilize Elliptic Curve Cryptography in the design of an efficient key management scheme for sensor nodes. The performance evaluation and security analysis show that our key management scheme can provide better security with significant reductions on communication overhead, storage space and energy consumption than other key management schemes.

SpaceFibre [1][2][3] is the next generation of SpaceWire [4] on-board data-handling network technology for spaceflight operations, which runs over both electrical and fibre optic media. SpaceFibre has many benefits compared to SpaceWire, including much higher data-rates, integrated quality of service, fault recovery capabilities, multi-laning with graceful degradation and hot and cold redundancy, and low-latency broadcast messages that can carry 8-bytes of user information. Importantly SpaceFibre is backwards compatible with SpaceWire at the network level, allowing existing SpaceWire equipment to be incorporated into a SpaceFibre network without modification. SpaceFibre networks have been defined by the University of Dundee and STAR-Dundee, and incorporated in the network layer definition of the current draft SpaceFibre standard. STAR-Dundee has designed a SpaceFibre routing switch to evaluate various routing concepts, validate the standard specification and demonstrate a complete SpaceFibre network. A demonstration system has been built and key parts of the SpaceFibre network technology have been demonstrated.

Mobile ad-hoc network is a collection of mobile nodes which forms an instant network without fixed topology and can be arranged dynamically. Energy saving and security are important issue in MANET. Network coding technique is used to reduce energy consumption by less transmissions in MANET. To achieve a security, there are many encryption scheme are available. Out of which p-coding technique is lightweight encryption scheme which provides confidentiality. P-coding is to let the source randomly permute the symbol of each packet. So eavesdropper can't obtain the meaningful information without knowing the permutation encryption function and coding vector.

In a mobile ad hoc network (MANET) there is a collection of wireless devices which moving in seemingly adventitious directions and communicating with one another without establishing the real infrastructure. Communicating nodes in a Mobile Ad hoc Network normally seek the help of other intermediate nodes to establish communication channels. Thus, the communication may be via many intermediate nodes from source to destination. Multi-path routing is better one than the single path routing in mobile ad hoc networks, this is because many path routing allows the lay foundation of many path between a single source and single destination node. But in multipath routing, there is a problem of overhead management and transportation performance. So the aim of this work is to design such a wireless system which uses reactive multipath routing protocol who gives better data transportation performance than baseline protocols. Also it improves throughput and packet delivery ratio with reduction in overhead and end to end delay. The proposed approach contains implementation of better routing protocol which provide proper route updates, set require parameters at proper value, generate wireless network which has low error rate and fast packet generation. We used ns-2 to simulate. Simulation results will show better data transportation performance than baseline protocols. Also it will show improvements in throughput and packet delivery ratio with reduction in overhead and end to end delay.

Ever increasing user demands and development of modern communication technologies have led to the evolution of communication networks from 1st Generation (1G) network to 4G heterogeneous networks. Further, 4G with heterogeneous network environment will provide features such as, “Always Best Connected”, “Anytime Anywhere” and seamless communication. Due to diverse characteristics of heterogeneous networks such as bandwidth, latency, cost, coverage and Quality of Service (QoS) etc., there are several open and unsolved issues namely mobility management, network administration, security etc. Hence, Designing proficient mobility management to seamlessly integrate heterogeneous wireless networks with all-IP is the most challenging issue in 4G networks. Mobile IPv6 (MIPv6) developed by Internet Engineering Task Force (IETF) has mobility management for the packet-switched devices of homogeneous wireless networks. Further, mobility management of homogeneous networks depends on network related parameter i.e., Received Signal Strength (RSS). However the mobility management of heterogeneous networks, not only depends on network related parameters, but also on terminal-velocity, battery power, location information, user-user profile & preferences and service-service capabilities & QoS etc. Designing mobility management with all-IP, while, considering issues such as context of networks, terminal, user and services is the main concern of industry and researchers in the current era.

Security and trust are major prerequisites for the deployment of Internet of Things (IoT) infrastructures. In this paper we present secure elements providing TLS and DTLS stacks, and running the CoAP protocol dedicated to IoT systems. These secure elements are used in an electronic lock context, in which the lock is a CoAP server and the key a CoAP client. We define two main security domains one for key interaction with the lock, and the other for key generation. These two domains are associated to applications running in SIM cards managed by mobile applications. Key generators are hosted in secure elements plugged in key servers, built over the RACS protocol. We introduce an innovative double TLS concept that avoids application tampering by cloud provider. Finally we discuss scalability issues of this approach.

Major Internet service providers deploy SMS-based verification mechanisms to fortify the security of users’ accounts for critical actions such as password reset and logging in from a new computer. In this paper, we describe a new type of phishing attack where an attacker triggers the delivery of a verification code from a service provider to a user and lures the user to forward the code to him so that he can bypass the SMS verification process. We call this a Verification Code Forwarding Attack (VCFA). The attacker can use VCFA to reset a password of a user’s account or to get access to a 2-factor enabled account which he already knows its password (e.g., through leaked databases). We attribute the success of this attack to the lack of an effective and usable means for users to verify the service provider, the lack of context for the message sent, and an assumption about users’ understanding of the authentication process. To show the susceptibility of the users to such an attack, we conducted an experiment with 20 mobile phone users and found that more than 25 % of users were vulnerable against this type of attack. A semi-structured interview with the subjects of the experiment and a survey of 100 subjects on Amazon Mechanical Turk were done to explore possible causes for the success of this type of attack. We also discuss possible remediation.