Performance Evaluation of a Helper Initiated Distributed Cooperative Medium Access Control Protocol for Wireless Networks

Cross layer cooperative protocol which exploits the benefits of physical layer cooperative communication, is one of the widely recognized MAC layer protocol design strategies for future wireless networks. This paper presents performance analysis of a cooperative mac and these performance parameters are compared those of the legacy IEEE 802.11 DCF MAC. Appropriate relay station selection is the main hurdle in designing efficient cooperative MAC protocol for wireless networks.  This cooperative mac demonstrated that intermediate relay nodes themselves can initiate cooperation for relaying data frame to the receiver on behalf of the sender. This procedure makes the selection process of a “helper node” more distributed in nature as well as it contributes to increase throughput of a wireless network by reducing the overheads that are usually incurred in the helper selection process. It has been shown by thorough analytical analysis that the proposed cooperative MAC protocol offers higher throughput and lower frame transmission delay in both ideal and error prone wireless environment. These performance metrics are also evaluated while the wireless nodes are mobile as well

A survey on android security: development and deployment hindrance and best practices

Android OS is the most popular mobile OS for the past few years. Vulnerabilities arise with respect to the increasing functionality of Android OS, impolitic app development practices of developers, end-user incautious and interestingly remediation for the vulnerabilities has been introduced frequently as well. To mitigate security risk factor Google has been updated, deprecated and restricted many system level APIs for 3rd party developers. Considering the consequences, this paper provides a wide overview of Android’s system level app development, privacy issues, and guideline for the developers about what measure they should consider while developing apps. We also discussed the historical development of Android OS and the end-users role to maintain privacy and to minimize security risks

Offloading in P4 Switch Integrated with Multiple Virtual Network Function Servers

Software Defined Networking (SDN) and Network Function Virtualization (NFV) are two transformative technologies that offer distinct benefits. SDN virtualizes the control plane by separating it from the data plane, while NFV virtualizes the data plane by moving network functions from hardware and implementing them in software. Therefore, combining SDN and NFV can fully exploit the benefits of both technologies. As Programming Protocol-independent Packet Processors (P4) become popular due to its flexibility, traditional SDN switches are being replaced by P4 switches. In the P4+NFV architecture, network functions can be provided in both P4 switches (PNF) and NFV servers (VNF). However, to minimize packet delay, the offloading problem between P4 switches and NFV needs to be addressed. The novelty of our paper lies in investigating the offloading problem and evaluating the impact of employing multiple VNFs with varying computing capacities within the P4+NFV architecture. We also use M/M/1 queuing theory to derive the average packet delay and propose an optimization solution based on gradient descent to find out the optimal offloading probabilities of various VNF servers. Results show that optimal offloading from P4 switch to multiple VNFs can reduce the average packet delay from 4.76% to 40.02%

Cost and Efficiency Analysis of NEMO Protocol Entities

To support IP-mobility of networks in motion, IETF proposed Network Mobility (NEMO) protocol that uses various signaling messages to ensure connectivity of the mobile nodes with the Internet and to maintain security of ongoing sessions by protecting the binding updates. As the next-generation wireless and mobile network is supposed to be a unified network based on all-IP technology, compounded by the fact that the number of mobile nodes requiring mobility support has increased significantly, the cost analysis of mobility protocols and the underlying mobility management entities have become essential to avoid their performance degradation. However, there has been no comprehensive cost analysis of NEMO protocol entities that considers all possible costs. In this paper, we have developed analytical models to estimate total costs of key mobility management entities of NEMO. We have defined a metric to compute the efficiency of mobility protocol as well as the mobility entities to find out the percentage of resources used for data (payload) delivery. We have presented numerical results to demonstrate the impact of network size, mobility rate, traffic rate and data volume on the total costs and the efficiency of the NEMO protocol and its key entities. Our results show that a significant amount of resources (bandwidth, processing power, transmission power) are required by the mobility entities for transmission, processing of various signaling messages, as well as searching location database. Our cost analysis will thus help network engineers in estimating actual resource requirements for the key entities of the network in future design while analyzing the data transmission efficiencies of these entities.YesPeer-reviewed journal article

A New Random Walk for Replica Detection in WSNs

The authors wish to thanks the anonymous reviewers for their valuable comments for the improvement of this manuscript. The authors wish to acknowledge the support and help of Deanship of Scientific Research at Jazan University and the authors also extend their sincere appreciations to Deanship of Scientific Research at King Saud University for its funding this Prolific Research Group (PRG-1436-16).Wireless Sensor Networks (WSNs) are vulnerable to Node Replication attacks or Clone attacks. Among all the existing clone detection protocols in WSNs, RAWL shows the most promising results by employing Simple Random Walk (SRW). More recently, RAND outperforms RAWL by incorporating Network Division with SRW. Both RAND and RAWL have used SRW for random selection of witness nodes which is problematic because of frequently revisiting the previously passed nodes that leads to longer delays, high expenditures of energy with lower probability that witness nodes intersect. To circumvent this problem, we propose to employ a new kind of constrained random walk, namely Single Stage Memory Random Walk and present a distributed technique called SSRWND (Single Stage Memory Random Walk with Network Division). In SSRWND, single stage memory random walk is combined with network division aiming to decrease the communication and memory costs while keeping the detection probability higher. Through intensive simulations it is verified that SSRWND guarantees higher witness node security with moderate communication and memory overheads. SSRWND is expedient for security oriented application fields of WSNs like military and medical.Yeshttp://www.plosone.org/static/editorial#pee

Detection Probability vs. walks step (r = 3 & # areas = 3 & 5)

<p>Detection Probability vs. walks step (r = 3 & # areas = 3 & 5)</p

Working Principle of RAND [13, 14]

<p>Working Principle of RAND [<a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0158072#pone.0158072.ref013" target="_blank">13</a>, <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0158072#pone.0158072.ref014" target="_blank">14</a>]</p