Current Issue : April - June Volume : 2014 Issue Number : 2 Articles : 6 Articles
The communication between network nodes within different protocol domains is often regarded simply as a black box with\r\nunknown configuration conditions in the path. We address network heterogeneity using a white box approach and focus on its\r\ninterconnection processes. To achieve this purpose, a Performance Analysis Framework (PAF) is proposed which is composed of\r\nthe formalization of the latter using process algebra (PA) and the corresponding teletraffic performancemodels. In this contribution,\r\nwe target the IEEE 802.16 and IEEE 802.11 protocols. For the teletraffic models, we extend previous models for such scenario with\r\nthe inclusion of the following protocol operational parameters (metrics): bit error rate (BER), packet error ratio (PER), and packet\r\nlength (pl). From the framework teletraffic models, the optimal packet length (OPL), end to end throughput, delay, and packet\r\nloss are obtained.The PAF outperforms previous modeling solutions in terms of delay and throughput relative to NS3 simulation\r\nresults....
Data aggregation is an important method to reduce the energy consumption in wireless sensor networks (WSNs); however,\r\nit suffers from the security problems of data privacy and integrity. Existing solutions either have large communication and\r\ncomputation overheads or only produce inaccurate results. This paper proposes a novel secure data aggregation scheme based\r\non homomorphic primitives inWSNs (abbreviated as SDA-HP). The scheme adopts a symmetric-key homomorphic encryption to\r\nprotect data privacy and combines it with homomorphic MAC synchronically to check the aggregation data integrity. It compares\r\nthe scheme with the previously known methods such as SIES, iPDA, and iCPDA in terms of the data privacy protection efficiency,\r\nintegrity performance, computation overhead, communication overhead, and data aggregation accuracy. Simulation results and\r\nperformance analysis show that our SDA-HP requires less communication and computation overheads than previously known\r\nmethods and can effectively preserve data privacy, check data integrity, and achieve high data transmission efficiency and accurate\r\ndata aggregation rate while consuming less energy to prolong network lifetime. To the best of our knowledge, this is the first work\r\nthat provides both integrity and privacy based on homomorphic primitives....
In M2M networks, most nodes are powered by battery; hence the overused nodes may easily be out of power, which causes the\r\nreduction of network lifetime. To solve this problem, it is helpful to balance network load into more nodes and links, so as to reduce\r\nnetwork congestion. Multipath routing is a useful tool to reduce congestion, since data flow can be dispersed into multiple paths.\r\nHowever, most of the previous multipath routing algorithm is based on the path disjoint constraint, which leads to the lack of\r\nrouting paths and the failure to disperse data flow into more links. In this paper, a directed acyclic graph based multipath routing\r\nalgorithmfor congestion minimization (DAGMR)is proposed,where different routing paths are confined in a directed acyclic graph\r\n(DAG) under time delay constraint. Furthermore, the data flow distribution is accomplished through partial capacity network to\r\nobtain the minimalmultipath routing congestion factor. Simulation indicates that our algorithm can obtain lower congestion factor\r\nand formulates multipath routing graph with more nodes and links than algorithm with path disjoint constraint. In addition, our\r\nalgorithm is a polynomial time complexity algorithm with nodes and links number of the entire network....
In recent years, barrier coverage problem in directional sensor networks has been an interesting research issue.Most of the existing\r\nsolutions to this problem aimto find as many barrier sets as possible to enhance coverage for the target area, which did not consider\r\nthe power conservation. In this paper, we address the efficient sensor deployment (ESD) problem and energy-efficient barrier\r\ncoverage (EEBC) problem for directional sensor networks. First, we describe a deployment model for the distribution of sensor\r\nlocations to analyzewhether a target area can be barrier covered. By this model,we examine the relationship between the probability\r\nof barrier coverage and network deployment parameters. Moreover, we model the EEBC as an optimization problem. An efficient\r\nscheduling algorithm is proposed to prolong the network lifetime when the target area is barrier covered. Simulation results are\r\npresented to demonstrate the performance of this algorithm....
The performance of a dual-hop amplify-and-forward (AF) relay system is studied with the ??th worst partial relay selection (PRS)\r\nprotocol under the joint impact of feedback delay and multiple cochannel interference (CCI) at the relay nodes. In our analysis,\r\nthe closed-formand asymptotic expressions of the outage probability are derived and the achievable coding gain and diversity gain\r\nof the system are accurately revealed. Further, based on the asymptotic analysis we propose a power allocation scheme, which can\r\nlead to SNR performance gains ofmore than 1 dB compared to the equal power allocation scheme. Finally,Monte-Carlo simulation\r\nresults are presented to verify the validity of our theoretical analysis....
Both wireless sensor networks and service-oriented architectures (SOA) are very popular distributed computing paradigm. Web\r\nservice is a widely accepted implementation of SOA. However, web service is based on Internet protocols and requires adaptation\r\nto suit the restrictions posed by WSNs. The development of Internet of Things has triggered research of web services of WSNs\r\nwhich made the consolidation of these technologies possible. At the same time, web service integration enables the support of\r\nmore functionalities since many applications rely on not just one web service, but a whole school of them.Thus, how to compose\r\nand integrate different web services efficiently to provide complicated services becomes an essential topic. This paper investigates a\r\nproblem which minimizes the number of hops of web services while integrating these web services to finish a set of tasks.We call\r\nthis problemMinimumHops of Service Integration Problem. It is proved that, when there are no precedence relationships between\r\nthe tasks, the decision problem is NP-complete. This implies that this web services integration problem is NP-hard. For the case\r\nwhen the relationships between the tasks are in linear order, a polynomial-time, optimal web service integration algorithm, using\r\ngreedy strategy, is provided....
Loading....