A Unicast Tree-Based Data Gathering Protocol for Delay Tolerant Mobile Sensor Networks
Journal Title: Journal of Information Systems and Telecommunication - Year 2016, Vol 4, Issue 1
Abstract
The Delay Tolerant Mobile Sensor Networks (DTMSNs) distinguish themselves from conventional sensor networks by means of some features such as loose connectivity, node mobility, and delay tolerability. It needs to be acknowledged that traditional end-to-end routing protocols cannot be applied usefully in such challenging network conditions because of intermittent connections and/or long delays. Hence, this research is intended to propose a Unicast Tree-based Data Gathering protocol (UTDG) to resolve this problem. A UTDG includes 3 phases: tree formation phase, data collection and data transmission phase, and finally the updating phase. The proposed protocol constructs a tree in each community on the basis of transmission ranking, contact probability and the link expiration time. The selection of the next-hop node is based on the tree structure rather than forwarding the message to the neighbor node directly. Each node unicasts the data to its parent in the related community, and the root of the tree successively sends the data to the sink node. The authors contend, based on the simulation results of the study, that the proposed protocol can gain significantly higher message delivery rates with lower transmission overhead and also lower delay in data delivery than the other existing DTMSNs routing protocols in some applications.
Authors and Affiliations
Zeynab Mottaghinia, Ali Ghaffari
Keywords
Related Articles
- EP ID EP184588
- DOI 10.7508/jist.2016.01.008
- Views 112
- Downloads 0
Computing Semantic Similarity of Documents Based on Semantic Tensors
Exploiting semantic content of texts due to its wide range of applications such as finding related documents to a query, document classification and computing semantic similarity of documents has always been an important...
A Hybrid Cuckoo Search for Direct Blockmodeling
As a way of simplifying, size reducing and making sense of the structure of each social network, blockmodeling consists of two major, essential components: partitioning of actors to equivalence classes, called positions,...
A Model for Mobile Code Computing Paradigms in Computer Networks
This paper presents a reliable model for mobile codes in distributed networks, which represents reliable mobile agent execution. The model ensures non-blocking mobile agent execution and forces the once property without...
Network RAM Based Process Migration for HPC Clusters
Process migration is critical to dynamic balancing of workloads on cluster nodes in any high performance computing cluster to achieve high overall throughput and performance. Most existing process migration mechanisms ar...
Referral Traffic Analysis: A Case Study of the Iranian Students' News Agency (ISNA)
Web traffic analysis is a well-known e-marketing activity. Today most of the news agencies have entered the web providing a variety of online services to their customers. The number of online news consumers is also incre...