Peer Protocols Research Articles

Networking of Sensors With Fixed Transmission Ranges: Distributed Data Processing Over Graphs

In this letter, we address the data gathering problem in low-power wireless sensor networks (WSNs) with sensors of fixed transmission ranges. We model the NP-hard problem as an integer linear program that can be applied to networks of small sizes. Further, we propose a novel graphical model that apprehends the features of such networks, and design a polynomial-time approximation algorithm using the proposed graphical model for networks of large sizes. The performance is evaluated under data compaction strategies based on compressive sensing. Simulation results demonstrate the superior performance of the proposed method over its peer protocols.

A lane-based advanced forwarding protocol for internet of vehicles

PurposeThe internet of vehicles (IoV) communication has recently become a popular research topic in the automotive industry. The growth in the automotive sector has resulted in significant standards and guidelines that have engaged various researchers and companies. In IoV, routing protocols play a significant role in enhancing communication safety for the transportation system. The high mobility of nodes in IoV and inconsistent network coverage in different areas make routing challenging. This paper aims to provide a lane-based advanced forwarding protocol for internet of vehicles (LAFP-IoV) for efficient data distribution in IoV. The proposed protocol’s main feature is that it can identify the destination zone by using position coordinates and broadcasting the packets toward the direction of destination. The novel suppression technique is used in the broadcast method to reduce the network routing overhead.Design/methodology/approachThe proposed protocol considers the interferences between different road segments, and a novel lane-based forwarding model is presented. The greedy forwarding notion, the broadcasting mechanism, and the suppression approach are used in this protocol to reduce the overhead generated by standard beacon forwarding procedures. The SUMO tool and NS-2 simulator are used for the vehicle's movement pattern and to simulate LAFP-IoV.FindingsThe simulation results show that the proposed LAFP-IoV protocol performs better than its peer protocols. It uses a greedy method for forwarding data packets and a carry-and-forward strategy to recover from the local maximum stage. This protocol's low latency and good PDR make it ideal for congested networks.Originality/valueThe proposed paper provides a unique lane-based forwarding for IoV. The proposed work achieves a higher delivery ratio than its peer protocols. The proposed protocol considers the lanes while forwarding the data packets applicable to the highly dense scenarios.

Design of high-speed blockchain-based sidechaining peer to peer communication protocol over 5G networks

Design of high-speed blockchain-based sidechaining peer to peer communication protocol over 5G networks

Ego effectiveness: A novel individual difference approach to health behavior and coping.

Taking care of one's health can require trading current feelings for longer-term considerations of health and well-being. The present research (total N = 366) sought to assess ego operations of this type in terms of the extent to which the self would be capable of responding to health-challenging situations in ways deemed to be effective. Ego effective individuals engaged in a greater frequency of health-protective behaviors as well as a lesser frequency of risky behaviors, both with respect to a peer protocol (Study 1) and a daily life protocol (Study 2). Findings are informative concerning multiple self-regulation perspectives on health.

A Secure Stop and Wait Communication Protocol for Disturbed Networks

Secure data communication is the need of hour today specifically when the wireless communication channel is insecure. We are proposing a protocol which can be customized in variety of situations. We want to use steganography as a complementary tool for cryptography. The protocol utilizes the nature of communication protocol and it is even useful for places where data hiding and cryptography is illegal or can’t be performed because of various reasons. We are giving a name to these kinds of networks as disturbed networks. The proposed peer to peer protocol is very useful for insecure channels and disturbed networks and we provide complete analysis to validate its utility. The method is a convenient stop and wait protocol which provides unbeatable security and suitable for mobile phones as well. At the same time, for intruder’s perspective, there is no encryption involved which is a very important aspect.

An energy efficient load balanced cluster-based routing using ant colony optimization for WSN

PurposeWireless sensor networks (WSNs) have emerged as one of the most promising technology in our day-to-day life. Limited network lifetime and higher energy consumption are two most critical issues in WSNs. The purpose of this paper is to propose an energy-efficient load balanced cluster-based routing protocol using ant colony optimization (LB-CR-ACO) which ultimately results in enhancement of the network lifetime of WSNs.Design/methodology/approachThe proposed protocol performs optimal clustering based on cluster head selection weighing function which leads to novel cluster head selection. The cluster formation uses various parameters which are remaining energy of the nodes, received signal strength indicator (RSSI), node density and number of load-balanced node connections. Priority weights are also assigned among these metrics. The cluster head with the highest probability will be selected as an optimal cluster head for a particular round. LB-CR-ACO also performs a dynamic selection of optimal cluster head periodically which conserves energy, thereby using network resources in an efficient and balanced manner. ACO is used in steady state phase for multi-hop data transfer.FindingsIt has been observed through simulation that LB-CR-ACO protocol exhibits better performance for network lifetime in sparse, medium and dense WSN deployments than its peer protocols.Originality/valueThe proposed paper provides a unique energy-efficient LB-CR-ACO for WSNs. LB-CR-ACO performs novel cluster head selection using optimal clustering and multi-hop routing which utilizes ACO. The proposed work results in achieving higher network lifetime than its peer protocols.

Exploring practices of Dermatologists in Ethical Dilemmas in Pakistan: A narrative analysis.

Background and Objective:Specialists in dermatology come across ethical issues in their practice. The topic is subjective so dialogue and reflection is required. The main objective of this study was to explore how dermatologists deal with ethical dilemmas in their clinical practice.Methods:This was a qualitative narrative analysis. It was conducted by involving dermatologists working in tertiary care hospitals across Pakistan from January to June 2017. Open ended semi structured in-depth interviews of twelve dermatologists were recorded and transcribed manually through transcribers verbatim. Thematic interactional analysis was done by NVivo 11.Results:Ethical dilemmas were narrated. Thematic analysis showed that compromises in standard medical and ethical practices were made on academics and training. Ethics were left to individual choice. Consultation of patients suffered due to quality of patient physician relationships and breeched patient’s confidentiality. In cosmetic dermatology unrestrained role of media, injudicious procedures and improper counseling created difficulties. Pharmaceuticals relation revolved around conflict of interest. In sexually transmitted diseases disclosure were difficult due to sociocultural limitations. In teledermatology practices patient’s confidentiality and consent were compromised while consultation remained challenging for dermatologists being visual only.Conclusion:Dilemmas appearing in everyday life needs peer discussion, reflections and protocols that should be role modeled.

Unraveling the Economic and Political Drivers of Deep Packet Inspection

The use of Deep Packet Inspection technology has been the focus of a growing amount of scholarly work due to its impact on sensitive policy issues. In this paper we look at the use of DPI for throttling or blocking peer to peer protocols by 288 broadband operators over three years, and correlate this with economic and political variables. Our empirical data shows that as of 2011, half of the studied ISPs are actively using DPI in their networks, although to varying degrees. We examine the role of seven economic and political drivers of DPI technology based on typical use-cases: bandwidth scarcity, network security, competition, surveillance, privacy protections, censorship and the strength of copyright industries. Performing bivariate analysis, we find that a few of these drivers are significantly correlated with the use of DPI.

The effect of peer review on mortality rates.

Lowering of mortality rates in hospitals with mortality rates higher than accepted reference values for acute myocardial infarction (AMI), congestive heart failure (CHF), pneumonia, stroke, mechanical ventilation (MV) and colorectal surgery by using an external peer review process that identifies areas requiring rectification and implements protocols directed at improving these areas. Retrospective, observational, quality management study using administrative data to compare in-hospital mortality rates (pre andpost an external peer review process that included adoption of improvement protocols) with reference values. German general hospitals of a large, private group. Hospitals with mortality rates higher than reference values. Peer review of medical records by experienced, outside physicians triggered by in-hospital mortality rates higher than expected. Inadequacies were identified, improvement protocols enforced and mortality rates subsequently re-examined. Mortality rates 1 year before and 1 year after peer review and protocol use. For AMI, CHF, pneumonia, stroke, MV and colorectal surgery, the mortality rates 1 year post-peer review were significantly decreased as compared to pre-peer review mortality rates. The standardized mortality ratio for all of the above diagnoses was 1.45, 1 year before peer review, and 0.97, 1 year after peer review. The absolute risk reduction of 7.3% translates into 710 deaths in this population which could have been prevented. Peer review triggered and conducted in the manner described here is associated with a significant lowering of in-hospital mortality rates in hospitals that previously had higher than expected mortality rates.

Modeling and optimizing Random Walk content discovery protocol over mobile ad-hoc networks

Content discovery is one of the challenges over mobile ad-hoc networks. Peer to peer content discovery techniques including structured and unstructured can be employed in MANETs by considering its special characteristics and limitations. The most important characteristics of MANETs are the mobility of the nodes, power consumption limitations and transitive links which create a dynamic topology. Unstructured techniques present higher performance compared to the structured ones over MANETs and among unstructured peer to peer protocols, Random Walk delivers less energy consumption and satisfactory hit rate awhile. This paper proposes an adaptive method to optimize the random walk unstructured content discovery protocol. First, it models this protocol using the G-network which is a queuing system with two types of customer, negative and positive. Then, it optimizes this protocol by the gradient descend technique based on a cost function which consists of three parameters. Two of these parameters are hit rate and response time which are derived from the content discovery protocol performance metric. The other parameter is energy consumption which is one of the most important performance metrics in MANET.

A Design on USSD Session Flow Based on SMPP Protocol

This paper is mainly to introduce The Short Message Peer to Peer (SMPP) protocol, and one of it’s major application to Unstructured Supplementary Services Data (USSD). The author intends to utilize SMPP protocol to realize a basic USSD Session flow.

Unravelling the Economic and Political Drivers of Deep Packet Inspection

The use of Deep Packet Inspection technology has been the focus of a growing amount of scholarly work due to its impact on sensitive policy issues. In this paper we look at the use of DPI for throttling or blocking peer to peer protocols by 288 broadband operators over three years, and correlate this with economic and political variables. Our empirical data shows that as of 2011, half of the studied ISPs are actively using DPI in their networks, although to varying degrees. We examine the role of seven economic and political drivers of DPI technology based on typical use-cases: bandwidth scarcity, network security, competition, surveillance, privacy protections, censorship and the strength of copyright industries. Performing bivariate analysis, we find that a few of these drivers are significantly correlated with the use of DPI.

Model and Protocol for Energy-Efficient Routing over Mobile Ad Hoc Networks

Many minimum energy (energy-efficient) routing protocols have been proposed in recent years. However, very limited effort has been made in studying routing overhead, route setup time, and route maintenance issues associated with these protocols. Without a careful design, an energy-efficient routing protocol can perform much worse than a normal routing protocol. In this paper, we first show that the minimum energy routing schemes in the literature could fail without considering the routing overhead involved and node mobility. We then propose a more accurate analytical model to track the energy consumptions due to various factors, and a simple energy-efficient routing scheme PEER to improve the performance during path discovery and in mobility scenarios. Our simulation results indicate that compared to a conventional energy-efficient routing protocol, PEER protocol can reduce up to 2/3 path discovery overhead and delay, and 50 percent transmission energy consumption.

Network Architectures and Data Management for Massively Multiplayer Online Games

Current-generation Massively Multiplayer Online Games (MMOG), such as World of Warcraft, Eve Online, and Second Life are mainly built on distributed client-server architectures with server allocation based on sharding, static geographical partitioning, dynamic micro-cell scheme, or optimal server for placing a virtual region according to the geographical dispersion of players. This paper reviews various approaches on data replication and region partitioning. Management of areas of interest (field of vision) is discussed, which reduces processing load dramatically by updating players only with those events that occur within their area of interest. This can be managed either through static geographical partitioning on the basis of the assumption that players in one region do not see/interact with players in other regions, or behavioural modelling based on players’ behaviours. The authors investigate data storage and synchronisation methods for MMOG databases, mainly on relational databases. Several attempts of peer to peer (P2P) architectures and protocols for MMOGs are reviewed, and critical issues such as cheat prevention on P2P MMOGs are highlighted.

Polymorphic Hybrid Multicast Routing Protocol for Mobile Ad hoc Network: PHMR

uting in mobile ad hoc network is an important research topic where various mechanisms have been already proposed concerning this issue. In this paper, we focus on one critical issue that is multicast routing.We propose in this paper implementation of an optimized, polymorphic, hybrid multicast routing protocol for MANET. This new polymorphic protocol attempts to benefit from the high efficiency of proactive behavior (in terms of quicker response to transmission requests) and the limited network traffic overhead of the reactive behavior, while being power, mobility, and vicinity-density (in terms of number of neighbor nodes per specified area around a mobile node) aware. The proposed protocol is based on the principle of adaptability and multibehavioral modes of operations. It is able to change behavior in different situations in order to improve certain metrics like maximizing battery life, reducing communication delays, improving deliverability, etc. The protocol is augmented by an optimization scheme, adapted from the one proposed for the Optimized Link State Routing protocol (OLSR) in which only selected neighbor nodes propagate control packets to reduce the amount of control overhead Extensive simulations and comparison to peer protocols demonstrated the effectiveness of the proposed protocol in improving performance and in extending battery power longevity.

Behavioural Correlation for Detecting P2P Bots

In the past few years, IRC bots, malicious programs which are remotely controlled by the attacker through IRC servers, have become a major threat to the Internet and users. These bots can be used in different malicious ways such as issuing distributed denial of services attacks to shutdown other networks and services, keystrokes logging, spamming, traffic sniffing cause serious disruption on networks and users. New bots use peer to peer (P2P) protocols start to appear as the upcoming threat to Internet security due to the fact that P2P bots do not have a centralized point to shutdown or traceback, thus making the detection of P2P bots is a real challenge. In response to these threats, we present an algorithm to detect an individual P2P bot running on a system by correlating its activities. Our evaluation shows that correlating different activities generated by P2P bots within a specified time period can detect these kind of bots.

Analyzing Chor Specifications by Translation into FSP

A choreography specifies activities and interactions among a set of services from a global point of view. From this specification, local implementations or peers can be automatically generated. Generation of peers that precisely implement the choreography specification is not always possible: this problem is known as realizability. This paper presents an encoding of the Chor choreography calculus into the FSP process algebra. This encoding allows to: (i) validate and verify Chor specifications using the FSP toolbox (LTSA), (ii) generate peer protocols from its choreography specified in Chor, (iii) test for realizability of the Chor specification, and (iv) generate Java code from FSP for rapid prototyping purposes. Our proposal is supported and completely automated by a prototype tool we have implemented.

A Peer to Peer Protocol for Online Dispute Resolution over Storage Consumption

In bilateral accounting of resource consumption both the consumer and provider independently measure the amount of resources consumed by the consumer. The problem here is that potential disparities between the provider's and consumer's accountings, might lead to conflicts between the two parties that need to be resolved. We argue that with the proper mechanisms available, most of these conflicts can be solved online, as opposite to in court resolution; the design of such mechanisms is still a research topic; to help cover the gap, in this paper we propose a peer--to--peer protocol for online dispute resolution over storage consumption. The protocol is peer--to--peer and takes into consideration the possible causes (e.g, transmission delays, unsynchronized metric collectors, etc.) of the disparity between the provider's and consumer's accountings to make, if possible, the two results converge.

DRAPS: A Framework for Dynamic Reconfigurable Protocol Stacks

Forthcoming networked systems require mechanisms for on-the-fly reconfiguration in their protocol stacks to be able to operate in different situations and networks. Since every protocol in a protocol stack has at least one peer protocol in another system, dynamic reconfiguration of a protocol raises the need for reconfiguration in the peer stack. For an assured dynamic (run-time) reconfiguration, executions of two peer protocols are stopped in a safe state, new protocols are initialized, and stacks switch to the new protocols at the same time. This paper proposes a software framework for dynamic reconfiguration of two communicating protocol stacks. A distributed algorithm is implemented in the framework of two communicating stacks in order to present an assured and synchronous reconfiguration of protocols. For demonstration, we have implemented a prototype of the framework and the algorithm to reconfigure two communicating TCP components by their secure version.

A Tool for Modeling Distributed Protocols

Recent peer to peer protocols have mainly been investigated and tested by discrete-event network simulators, e.g. ns-2. These software products usually model the network topology in great details, thus giving reliable picture about a possible run of the modeled protocol. In most cases they can estimate performance measures like throughput, traffic intensity, probability of failure, etc. These protocols are often analyzed in many ways, non of them are standard. In this paper, we elaborate on a new approach based on cellular automata designed to prove correctness of distributed protocols in some cases. Cellular automata are well known for their complex global behaviors, although they are constructed from simple and similar pieces. We shall demonstrate how standard distributed protocols can be modeled by cellular automata. The correctness of the protocols can also be proved by this technique, or – in some cases –counter-examples may be found. Our approach is supported by a simulator that can help researchers to model their protocols by the proposed method.