Social Energy-Based Techniques in Delay-Tolerant Network
01 Jan 2019-pp 531-538
TL;DR: In this paper, some of the energy-saving techniques are explained to reduce the energy consumption of the node and also increase the packet delivery ratio.
Abstract: Energy of nodes plays an important role in all kinds of networks whether it is wired network or wireless network, since most of the nodes are battery powered and it is not possible to recharge the battery whenever necessary In most of the networks, the data cannot be sent completely when the connection is terminated from source to destination Hence, the concept of delay-tolerant network (DTN) is introduced In DTN, due to the mobility of nodes most of the nodes have sufficient amount of energy which is required for transferring of data Energy is crucial issue in the concept of DTN, especially in disastrous like scenario, where recharging of battery becomes difficult The proper use of energy for data transmission increases nodes lifetime and network lifetime situation In this paper, some of the energy-saving techniques are explained to reduce the energy consumption of the node and also increase the packet delivery ratio
Citations
More filters
TL;DR: The demand–supply theory is deployed to mitigate nodes’ selfishness and to create incentives among them and the simulation of the proposed algorithm illustrates its superiority in terms of significant criteria such as delivery ratio, end-to-end delay, number of dropped messages, buffering time,number of hops, overhead ratio, etc.
Abstract: Disruption-tolerance networks (DTNs) are suitable for applications that may lack continuous network connectivity. Examples of such applications include coupon distribution, crisis relief, traffic notification, and broadcasting news from a website. Generally, these contents have a temporal constraint, so that their value will be decreased over time. DTNs have to utilize mobile relay nodes to transmit messages from the sender to the destination. These relay nodes often have selfish behavior, leading to a lack of cooperation. To improve the overall routing functionality, one must motivate relay nodes to share their resources. Thus, different incentives and rewarding mechanisms must be devised to encourage cooperation. We believe that microeconomics theories are appropriate mathematical tools to model the interactions between the DTN nodes. In microeconomics, buyers aim at maximizing their utility concerning their budget constraints. In this paper, the demand–supply theory is deployed to mitigate nodes’ selfishness and to create incentives among them. Each user can receive multiple sub-messages each of which containing special benefits for his/her. In this way, nodes are motivated to forward messages, which in turn leads to greater profitability for them and maximizing the social welfare of the society. The simulation of the proposed algorithm illustrates its superiority in terms of significant criteria such as delivery ratio, end-to-end delay, number of dropped messages, buffering time, number of hops, overhead ratio, etc.
14 citations
TL;DR: In this paper , the authors proposed an incentivized reputation scheme that first clusters the nodes using their social features, calculates the weighted social tie as their social connection strength and updates the weight by applying reward or penalty, the incentive is offered if residual energy and packet delay has a tradeoff or are penalized.
Abstract: Abstract Delay tolerant network is a boon in emergency fields like flood and war zones. The data gathered by the sensor nodes is transmitted whenever any aggregator node comes in contact with those stationary sensor nodes. However, few nodes can behave differently and don't transmit the information. These nodes which don't take part in communication to preserve it's battery or are compromised are selfish nodes and have to be identified to avoid communication disruption. This article discusses the selfish node's detection schemes and proposes a novel hybrid scheme. Most of the recent schemes work with on node's reputation or incentives if it takes part in communication. This paper has proposed an incentivized reputation scheme that first clusters the nodes using their social features, calculates the weighted social tie as their social connection strength and updates the weighted social tie by applying reward or penalty. The incentive is offered if residual energy and packet delay has a tradeoff or are penalized. A new modularized deep nonnegative matrix deep autoencoder is developed to calculate the reputation of nodes using social features and named IRU-mDANMF (incentivized reputation update by modularized DANMF). The scheme has been experimented with in several scenarios and is performing significantly better than state-of-the-art schemes.
3 citations
References
More filters
TL;DR: STARS, a contact-probing algorithm that adapts to the contact arrival process, is designed and it is demonstrated that STAR requires three to five times less energy for device discovery than a constant contact- Probing interval scheme.
Abstract: In many delay-tolerant applications, information is opportunistically exchanged between mobile devices that encounter each other. In order to affect such information exchange, mobile devices must have knowledge of other devices in their vicinity. We consider scenarios in which there is no infrastructure and devices must probe their environment to discover other devices. This can be an extremely energy-consuming process and highlights the need for energy-conscious contact-probing mechanisms. If devices probe very infrequently, they might miss many of their contacts. On the other hand, frequent contact probing might be energy inefficient. In this paper, we investigate the tradeoff between the probability of missing a contact and the contact-probing frequency. First, via theoretical analysis, we characterize the tradeoff between the probability of a missed contact and the contact-probing interval for stationary processes. Next, for time-varying contact arrival rates, we provide an optimization framework to compute the optimal contact-probing interval as a function of the arrival rate. We characterize real-world contact patterns via Bluetooth phone contact-logging experiments and show that the contact arrival process is self-similar. We design STAR, a contact-probing algorithm that adapts to the contact arrival process. Instead of using constant probing intervals, STAR dynamically chooses the probing interval using both the short-term contact history and the long-term history based on time of day information. Via trace-driven simulations on our experimental data, we demonstrate that STAR requires three to five times less energy for device discovery than a constant contact-probing interval scheme.
54 citations
TL;DR: An energy-efficient location-aware clone detection protocol in densely deployed WSNs, which can guarantee successful clone attack detection and maintain satisfactory network lifetime is proposed.
Abstract: In this paper, we propose an energy-efficient location-aware clone detection protocol in densely deployed WSNs, which can guarantee successful clone attack detection and maintain satisfactory network lifetime. Specifically, we exploit the location information of sensors and randomly select witnesses located in a ring area to verify the legitimacy of sensors and to report detected clone attacks. The ring structure facilitates energy-efficient data forwarding along the path towards the witnesses and the sink. We theoretically prove that the proposed protocol can achieve $100$ percent clone detection probability with trustful witnesses. We further extend the work by studying the clone detection performance with untrustful witnesses and show that the clone detection probability still approaches $98$ percent when $10$ percent of witnesses are compromised. Moreover, in most existing clone detection protocols with random witness selection scheme, the required buffer storage of sensors is usually dependent on the node density, i.e., $O(\sqrt{n})$ , while in our proposed protocol, the required buffer storage of sensors is independent of $n$ but a function of the hop length of the network radius $h$ , i.e., $O(h)$ . Extensive simulations demonstrate that our proposed protocol can achieve long network lifetime by effectively distributing the traffic load across the network.
48 citations
25 Mar 2013
TL;DR: This work shows that social-based routing algorithms such as BUBBLE Rap are prone to this behavior, and introduces energy awareness as an important criterion in the routing decision, and presents experimental results showing that the approach delivers performances similar to BUBble Rap, whilst balancing the energy consumption between nodes in the network.
Abstract: In particular types of Delay-Tolerant Networks (DTN) such as Opportunistic Mobile Networks, node connectivity is transient. For this reason, traditional routing mechanisms are no longer suitable. New approaches use social relations between mobile users as a criterion for the routing process. We argue that in such an approach, nodes with high social popularity may quickly deplete their energy resources - and, therefore, might be unwilling to participate in the routing process. We show that social-based routing algorithms such as BUBBLE Rap are prone to this behavior, and introduce energy awareness as an important criterion in the routing decision. We present experimental results showing that our approach delivers performances similar to BUBBLE Rap, whilst balancing the energy consumption between nodes in the network.
41 citations
TL;DR: This paper proposes a novel social-based routing approach for mobile social DTNs, where a new metric, i.e., social energy, is introduced to quantify the ability of a node to forward packets to others, inspired by general laws in particle physics.
Abstract: Delay-tolerant networks (DTNs) are intermittently connected networks, such as mobile social networks formed by human-carried mobile devices. Routing in such mobile social DTNs is very challenging, as it must handle network partitioning, long delays, and dynamic topology. Recently, social-based approaches, which attempt to exploit social behaviors of DTN nodes to make better routing decision, have drawn tremendous interest in the DTN routing design. In this paper, we propose a novel social-based routing approach for mobile social DTNs, where a new metric, i.e., social energy, is introduced to quantify the ability of a node to forward packets to others, inspired by general laws in particle physics. Social energy is generated via node encounters and shared by the communities of encountering nodes. Similar to the radiation of energy in physics, the social energy of any node decays over time. Our proposed social-energy-based routing (SEBAR) protocol considers social energy of encountering nodes and is in favor of the node with a higher social energy in its or the destination's social community. Our simulations with real-life wireless traces demonstrate the efficiency and the effectiveness of the SEBAR method by comparing it with several existing DTN routing schemes. In addition, two variations of SEBAR with the aim of overhead reduction are also presented and evaluated.
37 citations
Proceedings Article•
07 Feb 2010TL;DR: The performance issues with simple periodical interface activation are analyzed and a new activation mechanism called DWARF (DTN-oriented wireless interface activation mechanism based on radio fluctuations) is proposed for efficiently discovering other terminals with less expenditure of energy.
Abstract: In sparse mobile networks, opportunistic access can be used to forward data in a so-called “store-carry-forward” manner using Delay/Disruption Tolerant Networking (DTN) techniques. In such environments, it is not always the case that a mobile terminal is within the communication range of other mobile terminals. Therefore, the terminal must first perform the energy-consuming process of “terminal discovery” before sending or receiving actual data. Since a mobile terminal is normally battery powered, it is a mandatory requirement to cut power consumption. Therefore, the discovery process must be executed efficiently. In other words, it is imperative to activate a network interface at the right time. In this paper, we analyze the performance issues with simple periodical interface activation and propose a new activation mechanism called DWARF (DTN-oriented wireless interface activation mechanism based on radio fluctuations) for efficiently discovering other terminals with less expenditure of energy. In the proposed mechanism, the interface activation interval is adjusted based on the surroundings. DWARF is a distributed mechanism and does not require prior knowledge such as patterns of human behavior. Computer simulation results show that DWARF discovers other terminals about 3.5 times more efficiently than a fixed-interval scheme without missing opportunities for connection.
12 citations