Hop-by-hop data aggregation is a very important technique used to reduce the communication overhead and energy expenditure of sensor nodes during the process of data collection in a Wireless Sensor Network (WSN). However, the unattended nature of WSNs calls for data aggregation techniques to be secure. Indeed, sensor nodes can be compromised to mislead the base station by injecting bogus data i...

Network coding allows intermediate nodes to mix data in order to achieve higher throughput and better reliability. Hence, nodes combine multiple packets into a single packet before forwarding it. Such scheme needs efficient authentication and integrity mechanisms in order to prevent pollution attacks whereby an attacker injects bogus messages into the system instead of network coded blocks. Suc...

In this work‎, ‎we formulate Chatterjea contractions using graphs in metric spaces endowed with a graph ‎‎and‏ ‎‎‎‎investigate ‎the ‎existence‎ ‎of ‎fixed ‎points ‎for such mappings ‎under two different hypotheses‎. We also discuss the uniqueness of the fixed point. The given result is a generalization of Chatterjea's fixed point theorem from metric spaces to metric spaces endowed with a graph.

In this paper, we introduce a new class of implicit functions and also common property (E.A) in modified intuitionistic fuzzy metric spaces and utilize the same to prove some common fixed point theorems in modified intuitionistic fuzzy metric spaces besides discussing related results and illustrative examples. We are not aware of any paper dealing with such implicit functions in modified intuit...

In this paper we define weak $F$-contractions on a‎ ‎metric space into itself by extending $F$-contractions‎ ‎introduced by D‎. ‎Wardowski (2012) and provide some fixed point‎ ‎results in complete metric spaces and in partially ordered complete ‎generalized metric spaces‎. ‎Some relationships between weak‎ ‎$F$-contractions and $Fi$-contractions are highlighted‎. ‎We also ‎give some application...

Recently, Cho et al. [Y. J. Cho, R. Saadati, S. H. Wang, Common xed point theorems on generalized distance in ordered cone metric spaces, Comput. Math. Appl. 61 (2011) 1254-1260] dened the concept of the c-distance in a cone metric space and proved some xed point theorems on c-distance. In this paper, we prove some new xed point and common xed point theorems by using the distance in ordered con...

Recently, random linear network coding has been widely applied in peer-to-peer network applications. Instead of sharing the raw data with each other, peers in the network produce and send encoded data to each other. As a result, the communication protocols have been greatly simplified, and the applications experience higher end-to-end throughput and better robustness to network churns. Since it...

Two experiments were conducted to provide evidence concerning the contribution of self-presentation concerns to the self-serving bias in causal attribution (individuals' tendency to assume more personal responsibility for a success than for a failure outcome) and its occasional, but systematic, reversal. In Experiment 1 high- but not low-social-anxiety participants presented themselves in a far...

Sungkyunkwan University, Suwon 440-740, South Korea Summary Many sensor network applications are dependent on the secure operation of networks, and will have serious outcome if the network is disrupted or injured. Bogus reports can be injected through the compromised nodes, which can lead to not only false alarms but also the depletion of limited energy resource. Ye et al. proposed a statistica...

In typical sensor network applications, the sensors are left unattended for a long period of time. In addition, due to cost reasons, sensor nodes are usually not tamper resistant. Consequently, sensors can be easily captured and compromised by an adversary. Once compromised, a sensor can send authentique messages to other nodes and to the base station, but those messages may contain arbitrary d...