Performance Of Proposed Protocol Research Articles

Broadcast Scheduling Protocols in Multi-Hop Mobile Ad hoc Networks

When packets are sending in multi-hop mobile unintended networks numerous problems occur like flooding, rebroadcast, broadcast latency, power conservation and collision. If multiple transmission of packets simultaneously in MANETs that using the slot assignments approach, when additional channels are transmitting at the same time as the first slot allocations, interference may occur at the nodes. Because of the multi-hops data transfer, the network performance is hampered by the constrained bandwidth and therefore the self-initiated topological alterations. Therefore, a broadcast algorithm is important within the mobile ad hoc network for collision control and reliable communication. This paper proposes two new broadcasting protocols: modify SRBS and DSB algorithms. The planned algorithms outperform context of efficiency, reliability, traffic overload and reachability in highly mobile networks is an enhanced performance within the different environments. Evaluation of simulation results with other well-known exiting protocols as DFCN and PEGSP algorithms shows that the proposed protocol performance is best within the wireless network and channel bandwidths are well utilized within the network.

A secured and lightweight RFID-tag based authentication protocol with privacy-preserving in Telecare medicine information system

As a result of remarkable and continuous progress in Micro-Electro-Mechanical technologies, improved user-friendliness of low cast telecommunications like IoTs, mobile networks virtualization and intelligent technologies, we have novel healthcare delivery services with non-connection identification electronic components such as Radio Frequency Identification (RFID). RFID is extensively utilized in medical-oriented services like patient monitoring, object traceability, drug administration system, and Telecare medicine information system (TMIS), which receives special attention from healthcare management. TMIS works as a suspension bridge among patients staying at home, and doctors at healthcare organizations are authorized to validate the preciseness of exchanged data records among dissimilar organization participants. In recent times, TMIS adopted for patient data confidentiality, privacy protection, authentication, security, and safety over public channels. Researchers proposed a wide range of authentication protocols for RFID and TMIS by exploiting different cryptographic primitive solutions. However, most of them have large complex operations, scarce storage, and are not efficient. Whatever the security of TMIS improves, its application becomes wider. This paper designed an efficient and improved authentication protocol with high security for TMIS. The proposed protocol performance analysis in both Scyther and AVISPA tools shows that the protocol achieves high security and is well-suited for TMIS.

An Efficient Authentication Scheme for Internet of Things

The Internet of Things (IoT) is increasingly affecting human lives in multiple profound ways. “Things” have the ability to communicate, generate, transmit and store data over the network connection. During each communication between “Things”, the data transmitted is potentially vulnerable to malicious attacks, loss, distortions and interruption which impair functionality, system efficiency and user satisfaction. Additionally, inappropriate user controls can cause problems in IoT services, such as granting anonymous users access to personal resources and enable legitimate users to access resources in an illegal manner or preventing legitimate users to access resources in an authorized manner. Therefore, communications between things need to be authenticated, authorized, secured and ensured to have high privacy by applying a strong authentication protocol. The aim of this research is to enhance the authentication protocol, starting by reducing the heavy use of storage in “Things”, and eliminating unnecessary messages during authentication steps, taking into consideration the network security analysis. This research represents a security performance analysis and enhancement authentication for the IoT. The results indicate that the enhanced protocol has a positive effect on minimizing packet length and time performance in authenticating users having once obtained access to the visited location area compared with the other two protocols used for comparative purposes, with 33% increased the proposed protocol performance.

An Efficient Authentication Scheme for Internet of Things

The Internet of Things (IoT) is increasingly affecting human lives in multiple profound ways. “Things” have the ability to communicate, generate, transmit and store data over the network connection. During each communication between “Things”, the data transmitted is potentially vulnerable to malicious attacks, loss, distortions and interruption which impair functionality, system efficiency and user satisfaction. Additionally, inappropriate user controls can cause problems in IoT services, such as granting anonymous users access to personal resources and enable legitimate users to access resources in an illegal manner or preventing legitimate users to access resources in an authorized manner. Therefore, communications between things need to be authenticated, authorized, secured and ensured to have high privacy by applying a strong authentication protocol. The aim of this research is to enhance the authentication protocol, starting by reducing the heavy use of storage in “Things”, and eliminating unnecessary messages during authentication steps, taking into consideration the network security analysis. This research represents a security performance analysis and enhancement authentication for the IoT. The results indicate that the enhanced protocol has a positive effect on minimizing packet length and time performance in authenticating users having once obtained access to the visited location area compared with the other two protocols used for comparative purposes, with 33% increased the proposed protocol performance.

Improved Routing Vehicular Ad-Hoc Networks (VANETs) Based on Mobility and Bandwidth Available Criteria Using Fuzzy Logic

Vehicular ad-hoc networks as a subset of mobile ad-hoc networks have recently received considerable attention. In such networks, demands which are based on disseminating information from a source to vehicles in the road are increased. In these networks, the relatively high speed of vehicles leads to rapid change topology and routing and media access to practices presented in traditional network aren't responsible for this project. In this regard, one intelligent routing protocol for ad-hoc networks is proposed that is able to select Stability routes based on fuzzy logic for routing and increase network utilization rate, an important measure to evaluate the performance routing protocol. In the proposed method, each node acts as an autonomous agent and Routes based on selection of important criteria such as the rate of vehicle mobility and the available bandwidth. The proposed protocol performance was compared with AODV known protocol that the result of the simulator OPNET version 10.5 is indicative of better performance of the proposed protocol.

Destination buffer analysis for packets rejection obliteration in multi-channel networks

In this paper we study a multi-channel network, each station of which is equipped with a network interface that has a receiver buffer of multiple packets. In this way, each station is able to receive multiple packets per time instant. We adopt a synchronous access protocol which is affected by the collisions over the multiple channels and the destination conflicts. The proposed protocol performance crucially depends on the size of the receiver buffer since it determines the packet rejection probability at destination. An analytical probabilistic model based on a Markovian process is adopted for the performance measures derivation by means of closed mathematical formulas. The proposed protocol is compared to relative ones that either totally ignore the receiver collisions or assume a receiver buffer of a single packet capacity. The numerical results show that the increase of the receiver buffer size improves the performance decisively, resulting in higher throughput and lower delay and rejection probability. Also, it is shown that the appropriate receiver buffer size per station in order for the rejections at destination to be effectively eliminated is not unlimited but is limited to three packets for 0.1% accepted maximum level of rejection probability.

Minimization of delay and collision with cross cube spanning tree in wireless sensor networks

The wireless sensor network (WSN) is a system containing the event detection and the data gathering abilities. The data gathering mechanism is the fundamental but important procedure in the WSN environment. The way of the data gathering majorly affects the efficiency of WSNs on retrieving data at the sink node. It is generally known that the clustering techniques are effective to reduce the energy consumption in the WSNs. However, the research on the packet collision and the transmission delay in the Cluster based routing algorithm still remains limited. The packet loss and the transmission delay will happen more often due to collision and as such it will have negative impact on the WSN performance. In addition, the transmission delay phenomenon in the WSN may cause the inefficient result in the data gathering process. Unfortunately, it is usually neglected in the existing literature. To overcome the drawback of transmission delay and collision, a cluster-based converge cast tree (CCCT) protocol is proposed in this paper. The core of this protocol is to construct a cross cube spanning tree topology control algorithm. The proposed protocol performance is analyzed theoretically, which demonstrate that the protocol is efficient in avoiding packet collision and reducing the transmission delay. Finally, the protocol is examined by the simulations. The simulation results indicate that the proposed CCCT structure and algorithms outperform the existing approaches significantly in the realistic WSN environment.

Efficient Resource Consumption by Dynamic Clustering and Optimized Routes in Wireless Sensor Networks

The energy issue is an important parameter in the wireless sensor networks and should be managed in the different applications. We propose a new routing algorithm that it is energy efficient and uses different approaches as dynamic clustering, spanning tree, self-configurable routing and controls energy consuming by data-driven and power management schemas. It has two main phases. The first is consisting of the steady cluster, cluster head election and creation-spanning tree in each cluster and the second phase is data transmission. The proposed protocol is compared with four other protocols in network lifetime, network balance, and average packet delay and packet delivery. Simulation results show the proposed protocol performance in the network lifetime is about 6 per cent higher than Improved-LEACH, 21.5 per cent higher than EESR and 5.8 per cent higher than DHCO. Its improvement in packet delivery parameter is about 3.5 per cent higher than Improved-LEACH, 6.5 per cent higher than EESR and 3 per cent higher than DHCO. In addition, the performance or in packet delay is about 17 per cent higher than EESR and 6 per cent higher than DHCO but Improved-LEACH protocol has a good performance than our protocol about 4 per cent.

Trusted and Secured Routing Protocol for Vehicular Ad-Hoc Networks

Objectives: To establish a trust based secured routing protocol to accurately distinguish malicious nodes that are dropping the important information and modifying the routes. Efforts are made to identify malicious nodes such as route modifiers and packet droppers. Methods/Statistical Analysis: Vehicular Ad-hoc NETworks (VANETs) is a modern technology which help a vehicle and a driver in several ways. The main characteristics of VANETs are nodes i.e. vehicles with relatively high mobility and constantly changing topology. In case of data communication in VANETs, a source node must depend on the intermediate nodes to send its data packets to the destination node on multi-hop routes. VANETs can give better performance if all its nodes work properly with full cooperation during the communication. In VANETs, a node can generate and broadcast important and essential messages to other nodes in the network for safety reason. However, the generated message by a vehicle may not be reliable every time. In this paper we have proposed a trusted and secured routing protocol that evaluates the trust of a vehicle and also checks the message reliability. The proposed protocol is named as Trusted Vehicular Ad-hoc On-demand Distance Vector (TVAODV) routing protocol which is the modification of Ad-hoc On-demand Distance Vector routing protocol. Since VANETs are mostly attacked by the malicious nodes; therefore better security solution is needed to stop such attacks. The proposed protocol introduces a trust model to establish a malicious node free route for source node to send its data packets to the destination node on multi-hop routes. Findings: The TVAODV protocol is simulated in Network Simulator (NS2) to check the performance and accuracy and also compared to AODV routing protocol. It is found that TVAODV is comparatively better in performance when VANET is in high mobility and versatile topology. The performance of the proposed protocol is evaluated using performance measurement metrics: average end-to-end delay, throughput, routing load and packet delivery ratio. The proposed protocol performance is evaluated in the presence of malicious (route modifiers and packet droppers) vehicles and the results shows that the proposed protocol is achieved better accuracy and it shows better performance compared to AODV routing protocol. Application/Improvements: The proposed protocol may be useful in the process of developing a better traffic management and transportation system. In this paper we have proposed a TVAODV routing protocol which includes trust model to evaluate the trust of vehicles as well as to establish a malicious free route.

A traffic-depended multi-buffer node architecture and an effective access technique under symmetric and asymmetric IP traffic scenarios for unslotted ring WDM MANs

Abstract This study aims to put forward an extensive discussion about the increasing demand for available bandwidth to serve the multiple types of traffic in modern wavelength division multiplexing (WDM) metropolitan area networks (MANs). A traffic-depended multi-buffer node architecture in conjunction with an efficient asynchronous transmission WDM access (WDMA) protocol to serve the variable size Internet packets in ring MANs is proposed. The structure of the multi-buffer node architecture is determined by the probability distribution of each packet size category in the MAN traffic, providing storage and dropping events equity among the nodes. The adopted WDMA algorithm satisfies the requirement for high performance efficiency especially under high offered load, by taking care to optimally face the bandwidth fragmentation problem and to maximize the bandwidth exploitation, while it effectively avoids both the packets collisions over the wavelengths and the destination conflicts. Numerical results prove that the proposed network model achieves throughput improvement up to 334% as compared with the relative study of Pranggono and Elmirghani (2011). An analytical framework is developed for the protocol throughput predictions under both symmetric and asymmetric IP traffic scenarios. Also, the proposed protocol performance is thoroughly investigated through simulation results based on Poisson and self-similar traffic model statistics, for both traffic scenarios.

Optimized Cluster with Genetic Swarm Technique for Wireless Sensor Networks

Background/Objectives: In the current work, a Berkeley-Media Access Control (B-MAC) clustering protocol with a hybridized Genetic Algorithm (GA) as well as Particle Swarm Optimization (PSO) methods for overcoming the clustering issue through discovery of quantity of clusters, Cluster Heads as well as cluster members is proposed. Methods/Statistical Analysis: Wireless Sensor Networks (WSNs) are comprised of several quantities of minute nodes with restricted capabilities. The primary problem with these kinds of networks is the energy constraints. Plenty of research has been carried out in this field, with clustering emerging as the most efficient solution to the problem. The aim of clustering is the division of networks into groups with every group possessing a Cluster Head (CH). The job of Cluster Head is gathering, aggregating and transmitting data to Base Stations. Simulations using OPNET has been carried out in this study. Findings: The proposed protocol performance is tested for packet delivery ratio, end to end delay, number of hops to destination and jitter with various node mobility levels. The outcome reveals that the Local Search Binary PSO (LSBPSO) MAC Clustering performs better when compared with BMAC with flooding and BMAC with cluster based routing in either static or dynamic scenarios. Application/Improvements: Based on the performance of various MAC protocols, it is found that LSBPSO MAC clustering BMAC can be adopted for mobility based WSN applications like military recon operations, disaster management, security, healthcare systems, industrial mechanization and many others.

A Novel Energy-efficient Cooperative Transmission Scheme Based on V-BLAST Processing and ICA clustering for WSNs Lifetime Maximization

In wireless sensor network, one of the main objectives is how to improve its lifetime because the sensor nodes are generally energy-limited. Thus, providing ways to optimize energy Consumption, which ultimately increases the network lifetime, is of great importance. In this paper, we propose and evaluate an energy-efficient cooperative MIMO transmission scheme based on V-BLAST technique. In proposed scheme the clustering is done based on Imperialist Competitive Algorithm (ICA) then V-BLAST technique based virtual MIMO transmission are used. This proposed protocol performance is analytically and experimentally is compared with previous presented works. From the analysis and the simulation results, it is seen that the proposed method can reduce the energy consumption of the network and prolong the sensor networks lifetime compared with existing techniques.

Time Power Switching Based Relaying Protocol in Energy Harvesting Mobile Node: Optimal Throughput Analysis

We propose a new protocol for energy harvesting at relay mobile node in wireless communications called energy harvesting cooperative networks (EHCN). In particular, we investigate how the harvested power at relay mobile node affects outage probability and throughput performance. Specifically, we develop outage and throughput performance characterizations in terms of time and power factors in the proposed time power switching based relaying (TPSR) protocol. A simple, highly accurate closed-form formula of outage probability is also derived. It is shown that the optimal throughput of the EHCN is critically dependent on time switching and power splitting factor of the TPSR protocol. In addition, we extend the proposed protocol performance in ideal case of receiver. The tightness of our proposed protocol is determined through Monte Carlo simulation results. Finally, our results provide useful guidelines for the design of the energy harvesting enabled relay mobile node in the EHCN.

Efficient Location Privacy-Aware Forwarding in Opportunistic Mobile Networks

This paper proposes a novel fully distributed and collaborative k-anonymity protocol (LPAF) to protect users' location information and ensure better privacy while forwarding queries/replies to/from untrusted location-based service (LBS) over opportunistic mobile networks (OppMNets). We utilize a lightweight multihop Markov-based stochastic model for location prediction to guide queries toward the LBS's location and to reduce required resources in terms of retransmission overheads. We develop a formal analytical model and present theoretical analysis and simulation of the proposed protocol performance. We further validate our results by performing extensive simulation experiments over a pseudorealistic city map using map-based mobility models and using real-world data trace to compare LPAF to existing location privacy and benchmark protocols. We show that LPAF manages to keep higher privacy levels in terms of k-anonymity and quality of service in terms of success ratio and delay, as compared with other protocols, while maintaining lower overheads. Simulation results show that LPAF achieves up to an 11% improvement in success ratio for pseudorealistic scenarios, whereas real-world data trace experiments show up to a 24% improvement with a slight increase in the average delay.

캐리어이더넷 망 자동 구성 및 설정을 위한 GMPLS PCE 프로토콜의 확장 및 구현 연구

본 논문에서는 Generalized-Multiprotocol Label Switching(GMPLS) Path computation element(PCE) 표준 프로토콜을 확장하여 캐리어 이더넷 망을 제어하기 위해 새로운 시그널링 프로토콜을 정의한다. 제안된 프로토콜은 표준 GMPLS PCE 프로토콜과 호환성을 가지면서도 표준 프로토콜에서 경로 정보만을 제공하는 것을 확장하여 계산된 경로를 망에 자동 구성이 가능하도록 확장된 하이브리드 형 프로토콜이다. 또한 제안한 프로토콜을 직접 구현하여 실제 상용 장비에 적용하고 시험을 통해 제안된 프로토콜의 정확성과 상호 운용성을 검증하였으며 시뮬레이션을 통하여 프로토콜의 성능도 분석하였다. In this paper, we propose a new signaling protocol as an extension of Generalized Multi-Protocol Label Switching (GMPLS) based PCE protocol for control carrier ethernet. The proposed protocol is not only compatible with the GMPLS PCE standard protocol, but also provides the topology discovery and configuration. In order to verify interoperability, we implement the proposed protocol as well as the system integrating functions including commercial system for testbed. In addition, we have simulated topology discovery test for proposed protocol performance.

A MAC Protocol for LED visible light communications with beamforming

To increase the bit rate over than 1 Gb/s in LED visible light communications, we need to reduce the multipath effect of the light in indoor environment. In this paper, we propose a MAC protocol for LED visible light wireless LAN with beamforming technique. We assumed that spatial light modulator is used for beamforming function. We use polling method since detecting another uplink channel is difficult in visible light communication. We also estimated the performance of the proposed MAC protocol.

Path pruning in mailbox-based mobile agent communications

This paper is concerned with the design of efficient algorithms for mobile agent communications. We first describe a novel mailbox-based framework for flexible and adaptive message delivery in mobile agent systems and a specific adaptive protocol derived from the framework. Then we present the design and verification of a path pruning and garbage collection algorithm for improving the performance of the proposed protocol. Simulation results show that by properly setting some parameters, the algorithm can effectively reduce both the number of location registrations and the communication overhead for each registration. Consequently, the total location registration overhead during the life cycle of a mobile agent is greatly reduced. The algorithm can also be used for clearing useless addresses cached by hosts in the network.