Redundant Messages Research Articles

ON COVERAGE BOUNDS OF UNSTRUCTURED PEER-TO-PEER NETWORKS

In this paper, we develop methods to estimate the network coverage of a TTL-bound query packet undergoing flooding on an unstructured p2p network. The estimation based on the degree distribution of the networks, reveals that the presence of certain cycle-forming edges, that we name as cross and back edges, reduces the coverage of the peers in p2p networks and also generate a large number of redundant messages, thus wasting precious bandwidth. We therefore develop models to estimate the back/cross edge probabilities and the network coverage of the peers in the presence of these back and cross edges. Extensive simulation is done on random, power-law and Gnutella networks to verify the correctness of the model. The results highlight the fact that for real p2p networks, which are large but finite, the percentage of back/cross edges can increase enormously with increasing distance from a source node, thus leading to huge traffic redundancy.

Research of Route Algorithm Improvement in P2P Network based on Gnutella

The huge redundant messages generated by flooding which is the basic routing algorithm of unstructured P2P network, severely reduce the efficiency of the algorithm, Combining the advantages of flooding search algorithm and random walk algorithm,such as short response time,high stability, simple structure,to greatly reduce the redundancy of messages,this paper proposed an improved route search algorithm: JumpRandom-flood.The simulation results show that the algorithm can reduce the redundant messages,increase the efficiency of search,and improve the network environment while maintaining the desired coverage rate of nodes.

Research of a Novel P2P Search Algorithm Based on Small-World Phenomena

This paper proposes a novel breadth-first search algorithm and deals with the problem of duplicate web pages removing and page ranking by the principle of Small World phenomena. The features of algorithm in this paper are as follows: 1) it proposes the Unit Tree-based Breadth-First Search Algorithm and performs a qualitative analysis and simulated calculation of the performance, with the results demonstrating that the algorithm in this paper reduces the number of neighboring nodes to which messages shall be forwarded and redundant messages as compared with traditional Breath-First Search algorithm and Random Breath-First Search algorithm; 2) it proposes a solution to the problem of duplicate web pages removing and page ranking by Small World phenomena, with the results demonstrating that the method in this paper can effectively bring processing workload, waiting time and the pointless network bandwidth consumption of source node searching into balance.

HUBCODE: hub‐based forwarding using network coding in delay tolerant networks

ABSTRACTThis paper presents an efficient hub‐based message forwarding scheme for people‐centric DTN, wherein hubs (i.e. nodes with high degree distribution) are utilized as message relays. This scheme reduces redundant message transmissions without penalizing delivery ratio, since hubs collectively form a virtual data conduit which reaches most of the nodes. Further, in order to utilize bandwidth efficiently, this approach leverages linear network coding for exchanging messages among hubs. Copyright © 2011 John Wiley & Sons, Ltd.

Reliable Gossip Zone for Real-Time Communications in Wireless Sensor Networks

Gossip is a well-known protocol which was proposed to implement broadcast service with a high reliability in an arbitrarily connected network of sensor nodes. The probabilistic techniques employed in gossip have been used to address many challenges which are caused by flooding in wireless sensor networks (WSNs). However, very little work has yet been done on real-time wireless sensor networks which require not only highly reliable packets reception but also strict time constraint of each packet. Moreover, the unique energy constraining feature of sensor makes existing solutions unsuitable. Combined with unreliable links, redundant messages overhead in real-time wireless sensor networks is a new challenging issue. In this paper, we introduce a Reliable Gossip Zone, a novel fine-tailored mechanism for real-time wireless sensor networks with unreliable wireless links and low packet redundancy. The key idea is the proposed forwarding probability algorithm, which makes forwarding decisions after the realtime flooding zone is set. Evaluation shows that as an oracle broadcast service design, our mechanism achieves significantly less message overhead than traditional flooding and gossip protocols.

Reasonable routing in delay/disruption tolerant networks

Delay/disruption tolerant networking (DTN) is an approach to networking where intermittent connectivity exists: it is often afforded by a store and forward technique. Depending on the capability of intermediary nodes to carry and forward messages, messages can be eventually delivered to their destination by mobile nodes with an appropriate routing protocol. To have achieved a successful delivery, most DTN routing protocols use message duplication methods. Although messages are rapidly transferred to the destination, the redundancy in the number of message copies increases rapidly. This paper presents a new routing scheme based on a stochastic process for epidemic routing. Message redundancy is efficiently reduced and the number of message copies is controlled reasonably. During the contact process of nodes in the network, the number of message copies changes, and according to the variability in the number of copies, we construct a special Markov chain, birth and death process, on the number of message copies then calculate and obtain a stationary distribution of the birth and death process. Comparing the theoretical model with the simulation we have performed we see similar results. Our method improves on time-to-live (TTL) and antipacket methods, in both redundancy and delivery success efficiency.

Improving performance of network covert timing channel through Huffman coding

Network covert channel is a mechanism used to transfer covert message violating security policies through network. Performance of a channel is crucial to an attacker. Some studies have improved the performance by advancing the coding mechanism, but few ones have taken account of the redundancy of covert message. This paper introduces Huffman coding scheme to compress the transferred data by exploiting redundancy, and investigates the performance of the network timing channel according to the channel capacity and covertness. A mathematical model of capacity is presented and the effects of the parameters are analyzed. The experiment examines how the network delays and the Huffman coding scheme affect the capacity and covertness, and the results demonstrate that the performance of the timing channel is improved.

Message redundancy removal of multi-copy routing in delay tolerant MANET

This article puts forward a new scheme to control message redundancy efficiently in delay tolerant mobile Ad-hoc networks (MANET). The class of networks generally lacks end-to-end connectivity. In order to improve the efficiency that messages are delivered successfully, multiple message copies routing protocols are usually used, but the network load is increased due to a large number of message redundancies. In the study, by using counter method, every node adds an encounter counter based on epidemic routing scheme. The counter records the number which the node encounters other nodes with the same message copy. If the counter of a node reaches the installed threshold, the node removes the copy. Theoretical analysis gives a lower bound of threshold in delay tolerant MANET. According to the lower bound of threshold, a rational threshold is installed in real environment. With proposed scheme message copies decrease obviously and are removed completely finally. The successful delivery efficiency is still the same as epidemic routing and the redundant copies are efficiently controlled to a relatively low level. Computer simulations give the variation of message copies concerning different thresholds in fast and slow mobility scenes.

On the Security of Convertible Multiauthenticated Encryption Scheme and Its Improved Scheme

Abstract Multi-authenticated encryption is an important message transmission technique, which can send message in a secure and authentic way, and allows a group of signers to cooperatively produce a valid authenticated ciphertext so that only the specific recipient can recover the message and verify the signature. In 2008, Wu et al. proposed a convertible multi-authenticated encryption scheme. However, Tsai et al. showed that the computational complexity of this scheme is rather high and the message redundancy is used. To improve the computational efficiency and remove the message redundancy, they proposed a new convertible multi-authenticated encryption scheme based on the intractability of one-way hash functions and discrete logarithms. In this paper, we show that Tsai et al.’s scheme is not secure against rogue-key attacks. To overcome such attack, we give an improved multi-authenticated encryption scheme by including two hash functions. And our improved scheme is the same efficiency as Tsai et.al.’s scheme.

SKIP: an efficient search mechanism in unstructured P2P networks

Search efficiency and accuracy of resource are important considerations for search algorithm in peer-to-peer (P2P) network. Most search algorithms use flooding among neighbor nodes to search relevant resource. However, this usually causes great amount of redundant messages, which results in high search costs and low search precision. In this paper, we use vector space model (VSM) and relevance ranking algorithms to construct overlay network, and a novel search mechanism search with K-iteration preference (SKIP) based on semantic group for P2P networks is proposed to efficiently solve these problems. The key idea of SKIP is to reorder the semantic neighbors of nodes according to relevant scores and to utilize preference selection during the process of query. We analysis and implement the scheme and reveal that the SKIP provides a low overhead on topology maintenance, which can be effectively used in P2P searching and verify it outperformance in higher precision and lower search cost by comparing with current semantic-based searching mechanism gnutella-like efficient searching system (GES).

Saving Redundant Messages in BnB-ADOPT

We have found that some messages of BnB-ADOPT are redundant. Removing most of those redundant messages we obtain BnB-ADOPT+, which achieves the optimal solution and terminates. In practice, BnB-ADOPT+ causes substantial reductions on communication costs with respect to the original algorithm.

SocioNet: A Social-Based Multimedia Access System for Unstructured P2P Networks

Increasingly, peer-to-peer (P2P) network users expect to be able to search objects by semantic attributes based on their preferences for multimedia content. Partial match search (i.e., search through the use of multimedia content semantic information) has become an essential service in P2P systems. In this paper, we propose SocioNet, a social-based overlay that clusters peers based on their preference relationships as a small-world network. In SocioNet, peers mimic how people form a social network and how they query, by preference, their friends or acquaintances. Hence, SocioNet benefits from two desirable features of a social network: interest-based clustering and small-world properties (i.e., high cluster coefficient among all peers yet short path lengths between any two peers). To realize an interest-based small-world SocioNet, we also investigate the following practical design issues: 1) similarity estimation: we define a quantifiable similarity measure that enables clustering of similar peers in SocioNet; 2) distributed small-world overlay adaptation: peers maintain a small-world overlay under network dynamics; and 3) query strategy under the small-world overlay: we analyze appropriate settings for the Time-to-Live (TTL) value, for TTL-limited flooding, that provides a satisfactory success ratio and avoids redundant message overhead. We use simulations and a real database called AudioScrobbler [CHECK END OF SENTENCE], which tracks users' listening habits, to evaluate the performance of SocioNet. The results show that SocioNet assists peers in locating content at peers with similar interests through short path lengths, and hence, achieves a higher success ratio (than nonsmall-world interest-based overlays and noninterest-based small-world overlays) while reducing message overhead significantly.

Efficient and Reliable Broadcast in Intervehicle Communication Networks: A Cross-Layer Approach

Broadcast transmission is an effective way to disseminate safety-related information for cooperative driving in intervehicle communication (IVC). However, it is fraught with fundamental challenges such as message redundancy, link unreliability, hidden terminals, and broadcast storms, which greatly degrade network performance. In this paper, we introduce a cross-layer approach to design an efficient and reliable broadcast protocol for emergency message dissemination in IVC systems. We first propose a novel composite relaying metric for relay selection by jointly considering geographical locations, physical-layer channel conditions, and moving velocities of vehicles. Based on the relaying metric, a distributed relay-selection scheme is proposed to assure that a unique relay is selected to reliably forward the emergency message in the desired propagation direction. We further apply IEEE 802.11e enhanced distributed coordination access (EDCA) medium-access control (MAC) to guarantee quality-of-service (QoS) provisioning to safety-related services. In addition, an analytical model is developed to study the performance of the proposed cross-layer broadcast protocol (CLBP) in terms of the relay-selection delay and the emergency message access delay. Network Simulator (NS-2) simulation results are given to validate our analysis. It is shown that the CLBP not only can minimize the broadcast message redundancy but can quickly and reliably deliver emergency messages in IVC as well.

Security Challenges in Multicast Communication for Mobile Ad Hoc Network

Problem statement: Multicasting communication network accepted a single message from an application and delivered copies of the message to multiple recipients at different locations. Recently, there has been an explosion of research literature on multicast communication environment. The objective of this study were to contribute the complexity of supporting current multicast applications, (i) the lack of reliable multicast transport mechanisms at the network level and (ii) the lack of network support for large scale multicast communication. The scaling problem of secure multicast key distribution compounded for the case where sender-specific keys need to be distributed to a group and required for sender-specific authentication of data traffic and minimize control overhead (iii) compare RC4, AES-128,RS(2) and RS(3) computation time of both algorithms. Approach: Algorithms were collected and performed computation time. In general the multicast key distribution scheme implemented for distributing 128 bit session keys. Thus the Maximum Distance Separable Codes (MDS Codes) needed for their encoding and decoding process. In rekeying scheme errors were occurred during over period of time or at a particular point of time and to eliminate all these errors in the level of encryption and decryption mechanism. The MDS codes played an important role in providing security services for multicast, such as traffic, integrity, authentication and confidentiality, is particularly problematic since it requires securely distributing a group (session) key to each of a group’s receivers. Results: First we showed that internet multicasting algorithms based on reverse path forwarding were inherently unreliable and present a source-tree-based reliable multicasting scheme also. The new scheme proposed and used as an inter-gateway protocol and worked on top of the previously developed distance vector and link state internet routing schemes. Next, to support large scale applications, we presented a scheme for partial multicasting and introduced a new network level operation, called gather. The partial multicasting mechanism allowed messages to be delivered to subsets of multicast destinations, while the gather operation aids gateways in selectively suppressing redundant messages, thus reducing the message complexity. Conclusion: Hence the findings suggested the control overhead reasonably minimized and using simulations, we investigated the efficiency of our schemes in supporting scalable application domain based multicast communication.

Decentralized Coordination in RoboCup Rescue

Emergency responders are faced with a number of significant challenges when managing major disasters. First, the number of rescue tasks posed is usually larger than the number of responders (or agents) and the resources available to them. Second, each task is likely to require a different level of effort in order to be completed by its deadline. Third, new tasks may continually appear or disappear from the environment, thus requiring the responders to quickly recompute their allocation of resources. Fourth, forming teams or coalitions of multiple agents from different agencies is vital since no single agency will have all the resources needed to save victims, unblock roads and extinguish the fires which might erupt in the disaster space. Given this, coalitions have to be efficiently selected and scheduled to work across the disaster space so as to maximize the number of lives and the portion of the infrastructure saved. In particular, it is important that the selection of such coalitions should be performed in a decentralized fashion in order to avoid a single point of failure in the system. Moreover, it is critical that responders communicate only locally given they are likely to have limited battery power or minimal access to long-range communication devices. Against this background, we provide a novel decentralized solution to the coalition formation process that pervades disaster management. More specifically, we model the emergency management scenario defined in the RoboCup Rescue disaster simulation platform as a coalition formation with spatial and temporal constraints (CFST) problem where agents form coalitions to complete tasks, each with different demands. To design a decentralized algorithm for CFST, we formulate it as a distributed constraint optimization problem and show how to solve it using the state-of-the-art Max-Sum algorithm that provides a completely decentralized message-passing solution. We then provide a novel algorithm (F-Max-Sum) that avoids sending redundant messages and efficiently adapts to changes in the environment. In empirical evaluations, our algorithm is shown to generate better solutions than other decentralized algorithms used for this problem.

Mobile‐initiated network‐executed SIP‐based handover in IMS over heterogeneous accesses

AbstractThe services of next generation networks are envisioned to be potentially capable of seamless mobility in spite of the heterogeneity in underlying access technologies. It is undoubted that to accomplish seamless services across heterogeneous networking environments gets harder in case of simultaneous mobility. In this article, we propose a mobile‐initiated network‐executed (MINE) session initial protocol (SIP)‐based handover mechanism to facilitate simultaneous mobility in IP multimedia subsystem over heterogeneous accesses. The novelty of the proposed approach is that no changes are required to the existing network infrastructure since handover decision is fully made by the mobile host (MH) and handover execution is performed by a new‐added application server called mobility server (MS). When the MH decides to initiate a handover and obtains a new IP address, it will send a SIP Publish message to trigger the MS to carry out the handover execution. With the network‐executed design of the MINE, the MS can perform third‐party registration for security re‐association and third‐party call control for session re‐establishment in parallel. Moreover, the Master–Slave Determination procedures derived from H.245 are used in the MS to handle fairly the racing conditions resulting from simultaneous mobility such that redundant message flows are eliminated. Mathematical analyses present that the MINE can shorten the handover latency and reduce power consumption, as observed from a comparison with the integrated solution of an optimized macro‐mobility mechanism and a receiver‐side simultaneous mobility approach. Copyright © 2010 John Wiley & Sons, Ltd.

Research of Short Preamble MAC Protocol for Energy Efficient in Wireless Sensor Network

Idle listening is very critical source of energy dissipation in wireless sensor networks. To reduce idle listening, we propose preamble sampling MAC that is named EESP-MAC. The main idea of EESP-MAC is to add control information into the short preamble frame. So the stream of short preambles is used not only for preamble sampling but also for avoiding overhearing, decreasing control packet overhead and reducing the listening of the redundant message, caused by message-flooding.

Resilient P2P anonymous routing by using redundancy

One hurdle to using peer-to-peer (P2P) networks as anonymising networks is churn. Node churn makes anonymous paths fragile and short-lived: failures of a relay node disrupt the path, resulting in message loss and communication failures. To make anonymous routing resilient to node failures, we take two steps: 1) we use a simple yet powerful idea based on message redundancy by erasure coding and path redundancy to mask node failures; 2) we base mix choices of a path on node lifetime prediction and choose stable nodes as relay nodes, thereby prolonging single path durability. We present an allocation of erasure-coded message segments among multiple paths that provides a guideline on how to maximise routing resilience upon different node availabilities in real-world systems. Via detailed simulations, we compare routing resilience of our approach and existing anonymity protocols, showing that our approach greatly improves routing resilience while consuming modest bandwidth.

Enhanced Relevance-Based Approach for Network Controls

Simple flooding, probabilistic approach, area-based scheme, knowledge-based approach and Multi hop Vehicular broadcast is not suitable for VANETs scenario because of its dynamic nature. Relevance scheme is proposed to disseminate the relevant message for sharing in VANETs and discards the redundant messages from the network and improves the over all performance of network. The relevance-based approach does not provide network control and it only broadcast user traffic. This paper presents an improvement in mathematical model to consider the network control. Simulations using NS-2 show that proposed mathematical model consider the network control and improve the global benefit. Povzetek: Predstavljen je matematicen model izboljsanega nadzora in upravljanja z mrežo.

ADAPTIVE DATA DISSEMINATION IN MOBILE SENSOR NETWORKS

Motivated by emerging applications, we consider sensor networks where the sensors themselves (not just the sinks) are mobile. Furthermore, we focus on mobility scenarios characterized by heterogeneous, highly changing mobility roles in the network. To capture these high dynamics of diverse sensory motion we propose a novel network parameter, the mobility level, which, although simple and local, quite accurately takes into account both the spatial and speed characteristics of motion. We then propose adaptive data dissemination protocols that use the mobility level estimation to optimize performance, by basically exploiting high mobility (redundant message ferrying) as a cost-effective replacement of flooding, e.g. the sensors tend to dynamically propagate less data in the presence of high mobility, while nodes of high mobility are favored for moving data around. These dissemination schemes are enhanced by a distance-sensitive probabilistic message flooding inhibition mechanism that further reduces communication cost, especially for fast nodes of high mobility level, and as distance to data destination decreases. Our simulation findings demonstrate significant performance gains of our protocols compared to non-adaptive protocols, i.e. adaptation increases the success rate and reduces latency (even by 15%) while at the same time significantly reducing energy dissipation (in most cases by even 40%). Also, our adaptive schemes achieve significantly higher message delivery ratio and satisfactory energy-latency trade-offs when compared to flooding when sensor nodes have limited message queues.