Redundant Messages Research Articles

Robust and Efficient Broadcast Scheme of Event-Driven Warning Messages for Vehicular Environments

In vehicular ad hoc networks, it is important to broadcast time-sensitive and event-driven warning messages to vehicles. To improve traffic safety, a robust and efficient dissemination protocol is proposed for vehicle-to-vehicle communication aimed at supporting the dissemination of event-driven warning messages to approaching vehicles in an emergency situation. The objective is to minimize the number of rebroadcasting transmissions while simultaneously achieving low transmission latency and reducing redundant messages. To guarantee efficiency, the scheme time parameters are designed according to the mobility and the number information of neighboring vehicles. To guarantee robustness, the message dissemination performance of multiple vehicles is analyzed under various traffic conditions. Simulation studies are conducted with the ns-2.35 network simulation, and the robust and efficient dissemination protocol and two existing protocols (Flood, DV-CAST) are compared in transmission latency, delivery ratio, and total packets transmitted.

Message Propagation based on Three Types of Density Classification for Smooth and Secure Vehicular Traffic Flow

This paper proposes Message Propagation based on Three types of Density Classification for Smooth and Secure Vehicular Traffic Flow. The Message Propagation based on Three types of Density Classification (MPTDC) measures the density on three types of roads, namely a secluded rural road (0), a highway (1), and a urban intersection (2) and propagates messages to each classified one. When the type of message propagation is 1 and 2, the MPTDC generates a Cluster key by using MAC after grouping vehicles into a Cluster. The Cluster Header aggregates traffic information, and transfers it to a destination after filtering redundant or tampered traffic information. When the type of message propagation is 0, the MPTDC transfers traffic information by using RSU without generating a Cluster. In particular, when the type of message propagation is 2, the MPTDC selects a transmission path according to the density. Hence, this paper not only provides efficient communication but also improves the reliability of messages because it aggregates frequently encountered redundant messages.

Information-content of morphological and behavioural sexual traits in the Palmate newt (Lissotriton helveticus)

The question of why females evaluate more than one sexual trait to choose their mates has received increasing attention in recent years. Here, we investigated the information-content of both morphological and behavioural sexual traits that have been identified as predictors of male reproductive success in the palmate newt, Lissotriton helveticus. We examined the co-variation of multiple traits with one aspect of male quality, the male body condition, using both a correlative study and an experimental diet restriction. We found that the development of the three morphological sexual traits (filament length, hind-foot-web size, and crest size) was positively inter-correlated, and was correlated to body condition. In contrast, courtship activity, an important indicator for male reproductive success, was uncorrelated to male body condition. Our results suggest that females likely obtain redundant information on male condition when evaluating filament length, hind-foot-web size and crest size during mate choice. Contrary to our expectations, display activity was not a reliable indicator of male condition, leaving the information-content of this trait unraveled. Our results further suggest that complex, multiple traits may evolve because redundant message, unreliable signals and, possibly, multiple messages can coexist.

Application Demand Analysis of Message-Oriented Middleware with Pub/Sub Model on TT&C Computer

Message-Oriented Middleware(MOM) with Pub/Sub model is suitable for the information transmission of TT&C computer system for the advantage of fully information sharing, loosing coupling interconnects, many-to-many communication and flexible resources reorganization. This thesis introduces the basic concept of Pub/Sub model, analysis the characteristics of TT&C application.Priority it put forward the key technologies: Message model, Matching algorithm, Routing protocol and Redundancy virtualization strategy for establishing MOM with Pub/Sub model on TT&C compter system.

Reducing session establishment delay using timed out packets in SIP signaling network

SummarySession Initiation Protocol (SIP) has a retransmission mechanism to maintain the reliability for its real time transmission. But these real time transmissions cause overload in the server and creates redundant messages. SIP does not offer sufficient mechanisms for handling overload situations. In this paper, we study the SIP system behavior by separating signaling traffic in two different classes (Invites and Non‐invites) and creating a cut‐off priority queueing model. SIP retransmission mechanism with timeout is modeled as a queueing system with impatient customers. Using this model, the effect of unnecessary retransmissions is studied, and delay distribution and loss probability (Pb_loss) are calculated. The proposed analytical model is verified with simulations that demonstrate that the inclusion of timeout gives better delay performance. Using Pb_loss, an algorithm is developed to control the overload in hop‐by‐hop transaction as described in RFC 6357. The simulation results for the proposed model with overload control and the standard SIP as per RFC 3261 are compared. The results demonstrate that the server utilization factor of an overloaded server always remains less than one and hence avoids system collapse. Further, the redundant messages in the system are reduced by 30% as compared with the standard SIP network. Copyright © 2014 John Wiley & Sons, Ltd.

THE TECHNIQUE TO DETECT AND AVOID THE DENIAL OF SERVICE ATTACKS IN WIRELESS SENSOR NETWORKS

Wireless Sensor Networks (WSNs) have being used in many fields like ocean and wildlife monitoring, manufacturing machinery performance monitoring, building safety and earthquake monitoring, military applications and health related applications. The harsh and unattended deployment of these networks along with that in wireless sensor networks each node has limited energy, computation and storage space makes they are more vulnerable to attacks than wired networks. . It is a critical challenge to present the effective and lightweight security protocol to prevent various attacks for WSN, especially for the denial of service (DOS) attack. However, the adversaries can compromise some sensors and launch the DoS attack by replaying redundant messages or making overdose of fake messages. Under this situation, DoS attack breaks off the wireless communication channel and causes either unintentionally in the form of interference, noise or collision between the block the communication bandwidth, which makes the network not work well even fail down. In this paper we design message observation and common key authentication mechanisms by which cluster head (CH) as well as any other sensor nodes in network can able to identify the communicating node is an attacker node or not and isolate that attacker node. This approach is efficiently, detect and avoids Dos attack completely. Keywords-Wireless Sensor Networks, Denial of service attacks, Security ---------------------------------------------------------------------***-----------------------------------------------------------------

Dynamic Groups Based Adaptive DTN Routing Algorithms in Social Networks

Due to the nonexistence of end-to-end path between the sender and the receiver in delay tolerant networks and mobile social networks, consequently successful message transmission faces great challenges. In this paper, an adaptive routing algorithm taking full use of gregariousness characteristics of moving nodes is proposed. We first abstract all social relationships and uniformly represent them using friendship. Then by dynamically dividing nodes into different social groups, we finish flooding message among the target social group where destination node resides. In addition, we propose a social group based flooding model and a message redundancy control model to select fewer but better relay nodes and further reduce message redundancy. Extensive simulations have been conducted based on the synthetic traces generated by working day movement model and the results show that the proposed routing algorithm can get a higher message delivery ratio and a lower overhead ratio compared to Bubble Rap, Epidemic, and ProPHET, thus proving a better routing performance.

Everyone Needs Folic Acid is a digital program with face and content validity for low‐income diverse audiences (807.4)

Everyone Needs Folic Acid, a nutrition program delivered with a digital photo frame platform, was developed to help low‐income persons appreciate the role of folic acid (FA) for all age groups. Program assessment was conducted in 2 stages: Stage 1 focused on the original program and Stage 2 evaluated the subsequent program revisions. Participants (n=73) were white (97%), overweight or obese (43%), not eating competent (73%), and had at least 2 children (53%). The sample was low‐income; 42% used at least 1 assistance program in the past year and 27% were SNAP participants. The original program was easy to read (90%), understandable (87%), and helpful (66%). Suggested improvements were to provide dosage information, increase pictures of folic acid rich foods, and reduce message redundancy. Stage 2 participants (n=50) were recruited from the Stage 1 sample. When asked if they recalled any information about the original program 27% of Stage 2 respondents remembered a lot, 45% remembered some, and 28% reported little or no information recall. 72% had applied information to themselves or their family and 96% indicated that they would recommend this program to others. Participants compared 6 original with revised slides and preferred the original in 2 pairs, the revised slide in the other 4. Everyone Needs Folic Acid demonstrated face and content validity for SNAP‐eligible persons. Funded by USDA, SNAP Ed.Grant Funding Source: USDA, SNAP Ed

An emergency packet forwarding scheme for V2V communication networks.

This paper proposes an effective warning message forwarding scheme for cooperative collision avoidance. In an emergency situation, an emergency-detecting vehicle warns the neighbor vehicles via an emergency warning message. Since the transmission range is limited, the warning message is broadcast in a multihop manner. Broadcast packets lead two challenges to forward the warning message in the vehicular network: redundancy of warning messages and competition with nonemergency transmissions. In this paper, we study and address the two major challenges to achieve low latency in delivery of the warning message. To reduce the intervehicle latency and end-to-end latency, which cause chain collisions, we propose a two-way intelligent broadcasting method with an adaptable distance-dependent backoff algorithm. Considering locations of vehicles, the proposed algorithm controls the broadcast of a warning message to reduce redundant EWM messages and adaptively chooses the contention window to compete with nonemergency transmission. Via simulations, we show that our proposed algorithm reduces the probability of rear-end crashes by 70% compared to previous algorithms by reducing the intervehicle delay. We also show that the end-to-end propagation delay of the warning message is reduced by 55%.

An efficient flooding algorithm for improving network performance in optical WDM networks

In any networking environment, network and resource information has to be maintained periodically for re-routing the traffic. Especially in fault tolerant optical networks, after the faults are detected and recovered, the network topology changes have to be constantly configured for correct light path decisions to be made. In order to maintain correct routing tables and also to prevent blocking of forthcoming calls by the failed connection, the flooding messages have been broadcast to all nodes. When every node in the network floods the messages, problems arise of excessive redundancy of messages, resource contention and signal collision. This causes high protocol overhead and interference with the existing traffic in the networks. In this paper, lazy flooding algorithm is analysed and simulated by comparing the performance of all-flooding method and threshold flooding. Here, instead of flooding for each channel status update, such as to be changed from available to occupy or vice versa, we hold the process of update till it reaches certain points. The simulation results shows that the proposed flooding method achieves reduced blocking probability with increased throughput thereby increasing the scalability of the network.

An Improved Multipoint Relaying Scheme for Message Propagation in Distributed Peer-to-Peer System

Message propagation is a primary means to locate resources in current unstructured peer-to-peer (P2P) systems and how to reduce effectively the redundant messages of propagation while keeping its high network coverage is what many researchers go in for in this field. In this paper, we propose the algorithm of LMPR, a scheme of improved MPR for message propagation in distributed unstructured P2P system. Based on analyzing the process and message redundancy of MPR, this paper proposes to add to such scheme a mechanism of specified relay-list to reduce further the number of its retransmitting of message. By attaching to each relay-peer a relay-list with peers it will relay message to, the scheme can assure that in the view of each decision-peer a broadcast message can be dispatched and only be dispatched once to every neighbor peer within 2 hops of it. Simulation results show that the scheme of LMPR has better performance than that of MPR in message redundancy, network overhead, and fluctuation brought to the system.

New Adaptive Routing Proposal for DTN

Disruption Tolerant Networks, packet forwarding scheme has a major drawback in terms of network congestion. In order to solve this problem, a New Adaptive Routing Proposal (NARP) has been proposed NARP uses the message forwarding probability scheme in order to increase the delivery ratio and bandwidth utilization. Also, NARP arranges the dropping sequence based on their assigned priority. The priority is determined by the average hop count and average latency. Meanwhile NARP has an ACK list exchange mechanism that is used to purge the redundant messages. Simulation of NARP was carried out and its performance was compared to well known DTN routing protocols: Epidemic Routing, and Spray and Wait Routing. Simulation results show that NARP outperforms them in terms of packet delivery ratio, average latency, and overhead ratio.

An Advanced P2P Multicast Algorithm Based on Scribe

This paper presents an advanced multicast algorithm to the question of low multicast efficiency and poor game states synchronization in the SCRIBE algorithm based on P2P for MMOG. This algorithm constructs a multicast tree mainly considering node heterogeneity on bandwidth resource, computing resource and storage resource, moreover it approximately balances multicast tree by looking for a sub-tree which its high is lower. The experiment results show this algorithm can reduce message redundancy and multicast delay to a greater extent, and greatly improve game state synchronization.

HybridFlood: minimizing the effects of redundant messages and maximizing search efficiency of unstructured peer-to-peer networks

Peer-to-peer systems are important Internet applications. A major portion of Internet traffic belongs to such applications. Flooding search is a basic search scheme for unstructured peer-to-peer networks, where a node must send a query message to all its neighbors when seeking a file (in a file sharing situation). Flooding has no knowledge about network topology and files distribution, thus it offers an attractive method for file discovery in dynamic and evolving networks. Although pure flooding can achieve high coverage but it produces exponentially redundant messages in each hop. Consequently, the growth of redundant messages limits system scalability and causes unnecessary traffic in networks. Besides, flooding has no opportunity to get an advantage of node diversity of participating in unstructured P2P networks. To improve this searching scheme and reduce redundant messages, this paper proposes a novel algorithm named HybridFlood. This algorithm is divided into two steps. The first step follows the flooding with a limited number of hops. In the second step, nosey nodes are selected in each searching horizon. The nosey nodes are nodes which have the most links to other nodes. These nodes maintain the data index of all client nodes. We provided analytical studies for flooding and HybridFlood. The analytical results provided the best threshold point of hop for optimum coverage growth rate and redundant messages in flooding. It also proved in HybridFlood broadcasting messages are cut down at least an order of magnitude. Thus, the proposed algorithm extends the search efficiency by reducing redundant messages in each hop. The simulation experiments validated analytical results.

A hybrid multicast–unicast assignment approach for data distribution management in HLA

The main focus of data distribution management (DDM) in HLA is to reduce the amount of data received by federates in large-scale distributed simulations. The use of limited multicast resources plays a key role in the performance of DDM. In order to improve the performance of DDM by using communication protocol effectively, a hybrid multicast–unicast data transmission problem and its formal definition are presented, and then a hybrid multicast–unicast assignment approach is proposed. The approach uses a new adaptive communication protocol selection (ACPS) strategy to utilize the advantages of multicast and unicast, avoid their disadvantages, and consider the inter-relationship between connections. It includes the ACPS static assignment algorithm and the ACPS dynamic assignment algorithm, according to the difference between the static connections and the dynamic connections. In our approach, a concept of distance is presented to measure the inter-relationship between connections for multicast and the message redundancy for unicast, which is the core of the two algorithms in order to gather the connections to a multicast group or to balance the use of unicast and multicast for best performance. As a result, our algorithms can more effectively decide whether a new connection should use unicast or multicast communication, and whether adjusting previous assignment result can further improve the performance. In addition, a control mechanism is introduced to deal with connection changes during the dynamic assignment. The experiment results indicate that our algorithms can utilize the multicast and unicast communication resources effectively, as well as can achieve better performance than existing methods in the real running environment.

ReCREW: A Reliable Flash-Dissemination System

In this paper, we explore a new form of dissemination that arises in distributed, mission-critical applications called Flash Dissemination. This involves the rapid dissemination of rich information to a large number of recipients in a very short period of time. A key characteristic of Flash Dissemination is its unpredictability (e.g., natural hazards), but when invoked it must harness all possible resources to ensure timely delivery of information. Additionally, it must scale to a large number of recipients and perform efficiently in highly heterogeneous (data, network) and failure prone environments. We investigate a peer-based approach based on the simple principle of transferring dissemination load to information receivers using foundations from broadcast networks, gossip theory, and random networks. Gossip-based protocols are well known for being stateless, scalable, and fault-tolerant; however, their performance degrades as content size increases, because of the propagation of redundant gossip messages. In this paper, we propose Concurrent Random Expanding Walkers (CREW), a smart gossip protocol designed to maximize the speed of dissemination by transmitting data only as needed, and by exploiting both intra- and internode concurrency. CREW is designed to support both content and network heterogeneity and deal with transmission failures without sacrificing dissemination speed. We implemented CREW on top of a scalable middleware environment that allows for deployment across several platforms and developed optimizations without compromising on the stateless nature of CREW. We evaluated CREW empirically and compared it to optimized implementations of popular gossip and peer-based systems. Our experiments show that CREW significantly outperforms both traditional gossip and current large content dissemination systems while sustaining its performance in the presence of network errors.

A Data Transmission Scheme Based on Time-Evolving Meeting Probability for Opportunistic Social Network

With its widespread application prospects, opportunistic social network attracts more and more attention. Efficient data transmission strategy is one of the most important issues to ensure its applications. As is well known, most of nodes in opportunistic social network are human-carried devices, so encounters between nodes are predictable when considering the law of human activities. To the best of our knowledge, existing data transmission solutions are less accurate in the prediction of node encounters due to their lack of consideration of the dynamism of users' behavior. To address this problem, a novel data transmission solution, based on time-evolving meeting probability for opportunistic social network, called TEMP is introduced, and corresponding copy management strategy is given to reduce the message redundancy. Simulation results based on real human traces show that TEMP achieves a good compromise in terms of delivery probability and overhead ratio.

Energy Conservation in Tree-based Event Driven Wireless Ad-hoc Networks

nodes communicate over wireless links that typically have less bandwidth than in a wired network. Each node in a wireless ad hoc network functions as both a host and a router, and the control of the network is distributed among the nodes. The network topology is in general, dynamic, as the connectivity among the nodes may vary with time because of node departures, new node arrivals, and the change of environments. Hence, there is a need for efficient routing protocols to allow the nodes to communicate over multihop paths. This paper focuses on the effect of topology that requires to be locally and self-adaptively maintained, at a low communication cost, without affecting QOS. The preliminary research shows the contrast of energy expedited in a tree based network over the usual graph based network employing directed diffusion. The method achieves lesser energy consumption owing to reduction of the no of bits though unicast communication and discarding other redundant messages arriving later, thereby constricting the network to have at most one transmission for one event.

Energy minimization by exploiting data redundancy in real-time wireless sensor networks

In this paper, we devise scheduling algorithms to minimize energy consumption in Real-time Wireless Sensor Networks (WSNs) by leveraging the energy-delay tradeoff. Spatial and temporal correlation exhibited by WSNs can be exploited to reduce energy consumption. Previous research works attempt to exploit this correlation by way of aggregation or adaptive sampling. We propose determination of the data correlation at each node by way of local computation and propose avoiding transmission of significantly similar data. This can lead to unused time slots at runtime (dynamic slack) which can be traded off for energy savings. Our approach uses techniques namely Dynamic Voltage Scaling (DVS) and Dynamic Modulation Scaling (DMS), which utilize the slack generated dynamically to reduce energy consumption in a real-time environment. We propose heuristics with varying complexities for efficient slack management. We evaluate the performance of these heuristics by simulating diverse network conditions while incorporating different overheads. Our results show that the proposed heuristics can achieve energy savings up to 40% more than the baseline algorithms employing DVS and DMS, and, can achieve performance competitive with a Clairvoyant algorithm under network scenarios with high volume of redundant messages.

Organizational Communication in Emergencies: Using Multiple Channels and Sources to Combat Noise and Capture Attention

This study relies on information theory, social presence, and source credibility to uncover what best helps people grasp the urgency of an emergency. We surveyed a random sample of 1,318 organizational members who received multiple notifications about a large-scale emergency. We found that people who received 3 redundant messages coming through at least 1 synchronous communication source—for example, phone or face-to-face communication—perceived the urgency of the situation the most quickly, whereas those receiving official messages through asynchronous channels—most often text message—had the lowest sense of urgency. Our findings suggest that by understanding people's reactions to various kinds of redundant communication, organizations can design more strategic emergency messages that capture attention.