一种基于LBT的分布式图像压缩算法

无线多媒体传感器网络(WMSNs)中传感器节点采集的数据量非常大,在传输前需对大数据量的多媒体信息进行压缩处理,但是单节点能源受限,存储、处理能力相对较弱。针对无线多媒体传感器网络应用的高效、低耗能的需求这些问题,在图像压缩双正交重叠变换(LBT)的基础上,文中提出了一种基于此变换的分布式无线多媒体传感器网络图像压缩算法。即基于簇结构,把压缩任务分配给其他节点,通过多个节点相互协作,共同完成图像的压缩编码和传输。实验结果表明,在传感器节点散布不均且较为密集的情况下,该算法在高质量、低复杂度和低功耗等方面都有了很大的性能提高。     

QMOR: QoS-Aware Multi-sink Opportunistic Routing for Wireless Multimedia Sensor Networks

The energy efficiency and quality of service (QoS) provisioning of wireless multimedia sensor networks (WMSNs) are two major issues that impact the application of such networks. Recent studies demonstrate that network performance can be greatly improved by involving multiple sinks. However, mainstream WMSN routing protocols are generally designed to account for a single sink. This paper proposes a QoS-aware multi-sink opportunistic routing (QMOR) to efficiently deliver multimedia information under QoS constraints for WMSNs. We begin with an optimal nodes selection problem to reduce redundant multimedia data. Then, we focus on selecting and prioritizing forwarder list to enhance transmission efficiency. Finally, the multi-sink-aware operations are integrated into an optimization opportunistic routing framework, with an objective to minimize energy consumption subject to delay and reliability constraints. Our simulation results demonstrate that the QMOR performs better than typical WMSN QoS routing algorithm, in terms of the video transmission quality and energy utilization efficiency.     

QoS‐aware routing and power control algorithm for multimedia service over multi‐hop mobile ad hoc network

This paper presents a QoS (quality of service) aware routing and power control algorithm consuming low transmission power for multimedia service over mobile ad hoc network. Generally, multimedia services need stringent QoS over the network. However, it is not easy to guarantee the QoS over mobile ad hoc network since its network resources are very limited and time‐varying. Furthermore, only a limited amount of power is available at mobile nodes, which makes the problem more challenging. We propose an effective routing and power control algorithm for multimedia services that satisfies end‐to‐end delay constraint with low transmission power consumption. The proposed algorithm supports the required bandwidth by controlling each link channel quality over route in a tolerable range. In addition, a simple but effective route maintenance mechanism is implemented to avoid link failures that may significantly degrade streaming video quality. Finally, performance comparison with existing algorithms is presented in respect to traditional routing performance metrics, and an achievable video quality comparison is provided to demonstrate the superiority of the proposed algorithm for multimedia services over mobile ad hoc network. Copyright © 2010 John Wiley & Sons, Ltd.     

Equal Size Clusters to Reduce Congestion in Wireless Multimedia Sensor Networks

Wireless Multimedia Sensor Networks (WMSNs) are a particular instance of Wireless Sensor Networks that support the transmission of multimedia data such as video, image or sound. Those multimedia data should be delivered with a variety of predefined levels of Quality of Service swhich imposes the development of specific routing protocols. In this paper, we propose a new routing protocol based on clustering, that balances the number of nodes in clusters, called Equal Size Clusters to reduce Congestion in WMSNs. We seek to balance the number of members in each cluster in order to reduce intra-cluster congestion and reduce the number of congested cluster-heads. Therefore, we propose a novel metric called Maximum Cluster-heads Utilization Ratio (MCUR) that indicates the largest number of members assigned to a cluster-head to ensure a reliable transmission of multimedia data. Simulation results indicate that our proposed scheme outperforms other protocols proposed in the literature in terms of MCUR, number of cluster-heads and energy consumed.     

Energy efficient and perceived QoS aware video routing over Wireless Multimedia Sensor Networks

Wireless Sensor Networks (WSNs) have an ever increasing variety of multimedia based applications. Ιn these types of applications, network nodes should ideally maximize QoS and minimize energy expenditures in video communication. This article presents PEMuR, a novel dual scheme for efficient video communication, which aims at both energy saving and high QoS attainment. To achieve its objectives, PEMuR proposes the combined use of an energy aware hierarchical routing protocol with an intelligent video packet scheduling algorithm. The adopted routing protocol enables the selection of the most energy efficient routing paths, manages the network load according to the energy residues of the nodes and prevents useless data transmissions through the proposed use of an energy threshold. In this way, an outstanding level of energy efficiency is achieved. Additionally, the proposed packet scheduling algorithm enables the reduction of the video transmission rate with the minimum possible increase of distortion. In order to do so, it makes use of an analytical distortion prediction model that can accurately predict the resulted video distortion due to any error pattern. Thus, the algorithm may cope with limited available channel bandwidth by selectively dropping less significant packets prior to their transmission. Simulation results demonstrate the effectiveness of the proposed scheme.     

A topology and application‐aware relay path allocation scheme in multipath transport system based on application‐level relay

The ever‐increasing transmission requirements of quality of service (QoS)‐sensitive applications, especially real‐time multimedia applications, can hardly be met by the single path routing protocols. Multipath transmission mechanism is a feasible approach to provide QoS for various applications. On the basis of the general framework of multipath transport system based on application‐level relay, we present a relay path allocation scheme, whose goal is to select suitable relay paths, while balancing the overlay traffic among the different domains and relayers. With the application‐layer traffic optimization service under the standardization within the Internet Engineering Task Force (IETF), the controller has the topology‐aware ability to allocate relay paths with excellent routing performance. To further develop the universality of our method, the controller perceives transmission performance of relay overlay network through relayers' performance detection processes and, thus, has the application‐aware ability to allocate relay paths with excellent transmission performance for different applications by consulting application‐specific transmission metrics. Simulation results demonstrate that the proposed relay path allocation algorithm performs well in allocating superior relay paths and can balance the distribution of overlay traffic across domains in different network situations.     

Power Efficient Video Multipath Transmission over Wireless Multimedia Sensor Networks

This paper proposes a power efficient multipath video packet scheduling scheme for minimum video distortion transmission (optimised Video QoS) over wireless multimedia sensor networks. The transmission of video packets over multiple paths in a wireless sensor network improves the aggregate data rate of the network and minimizes the traffic load handled by each node. However, due to the lossy behavior of the wireless channel the aggregate transmission rate cannot always support the requested video source data rate. In such cases a packet scheduling algorithm is applied that can selectively drop combinations of video packets prior to transmission to adapt the source requirements to the channel capacity. The scheduling algorithm selects the less important video packets to drop using a recursive distortion prediction model. This model predicts accurately the resulting video distortion in case of isolated errors, burst of errors and errors separated by a lag. Two scheduling algorithms are proposed in this paper. The Baseline scheme is a simplified scheduler that can only decide upon which packet can be dropped prior to transmission based on the packet’s impact on the video distortion. This algorithm is compared against the Power aware packet scheduling that is an extension of the Baseline capable of estimating the power that will be consumed by each node in every available path depending on its traffic load, during the transmission. The proposed Power aware packet scheduling is able to identify the available paths connecting the video source to the receiver and schedule the packet transmission among the selected paths according to the perceived video QoS (Peak Signal to Noise Ratio—PSNR) and the energy efficiency of the participating wireless video sensor nodes, by dropping packets if necessary based on the distortion prediction model. The simulation results indicate that the proposed Power aware video packet scheduling can achieve energy efficiency in the wireless multimedia sensor network by minimizing the power dissipation across all nodes, while the perceived video quality is kept to very high levels even at extreme network conditions (many sensor nodes dropped due to power consumption and high background noise in the channel).     

QoS in Wireless Multimedia Sensor Networks: A Layered and Cross-Layered Approach

The emergence of wireless multimedia sensor networks (WMSN) has given birth to several civilian as well as defense applications. Some of the interesting applications employing low cost sensor nodes to manipulate rich multimedia content include traffic monitoring, border surveillance, smart homes, environment and habitat monitoring. Unlike the traditional sensor networks which are aimed at maximizing network lifetime by decreasing energy utilization, the main objective of WMSNs is optimized delivery of multimedia content along with energy efficiency. Multimedia communications in WMSNs, has stringent delay and high bandwidth requirement as compared to scalar data transfer in WSNs. Fulfilling these constraints in resource and energy constrained WMSNs is a huge challenge. In WMSNs, each layer of the protocol stack is responsible and fully involved in providing QoS guarantees. There is a need for new schemes at each layer of the protocol stack- from advanced coding techniques that reduce encoder complexity and achieve maximum compression to dynamic routing and MAC protocols that provide service differentiation and reduce end-to-end latency. In wireless sensor networks, where all layers have dependency on each other, QoS guarantees are possible through the cross layer interaction of different layers. This paper gives an overview of the different existing layered schemes in WMSNs, followed by a discussion on the significance and efficiency gains that can be achieved from cross layer interactions in WMSNs along with the review of the existing cross layer approaches. Finally, we identify the open research issues which have not been adequately addressed so far.     

An efficient online‐battery aware geographic routing algorithm for wireless sensor networks

Wireless sensor networks (WSNs) are being used in a wide variety of critical applications such as military and health‐care applications. Such networks, which are composed of sensor nodes with limited memory capacity, limited processing capabilities, and most importantly limited energy supply, require routing protocols that take into consideration these constraints. The aim of this paper is to provide an efficient power aware routing algorithm for WSNs that guarantees QOS and at the same time minimizes energy consumption by calculating the remaining battery capacity of nodes and taking advantage of the battery recovery process. We present an online‐battery aware geographic routing algorithm. To show the effectiveness of our approach, we simulated our algorithm in ns2 and compared it with greedy perimeter stateless routing for wireless networks and battery‐aware routing for streaming data transmissions in WSNs. Copyright © 2009 John Wiley & Sons, Ltd.     

Improving resource-constrained IoT device lifetimes by mitigating redundant transmissions across heterogeneous wireless multimedia of things

In Wireless Multimedia Sensor Networks (WMSNs), nodes capable of retrieving video, audio, images, and small scale sensor data, tend to generate immense traffic of various types. The energy-efficient transmission of such a vast amount of heterogeneous multimedia content while simultaneously ensuring the quality of service and optimal energy consumption is indispensable. Therefore, we propose a Power-Efficient Wireless Multimedia of Things (PE-WMoT), a robust and energy-efficient cluster-based mechanism to improve the overall lifetime of WMSNs. In a PE-WMoT, nodes declare themselves Cluster Heads (CHs) based on available resources. Once cluster formation and CH declaration processes are completed, the Sub-Cluster (SC) formation process triggers, in which application base nodes within close vicinity of each other organize themselves under the administration of a Sub-Cluster Head (SCH). The SCH gathers data from member nodes, removes redundancies, and forwards miniaturized data to its respective CH. PE-WMoT adopts a fuzzy-based technique named the analytical hierarchical process, which enables CHs to select an optimal SCH among available SCs. A PE-WMoT also devises a robust scheduling mechanism between CH, SCH, and child nodes to enable collision-free data transmission. Simulation results revealed that a PE-WMoT significantly reduces the number of redundant packet transmissions, improves energy consumption of the network, and effectively increases network throughput.     

Energy efficient distributed steganography for secure communication in wireless multimedia sensor networks

A secure communication mechanism is necessary in the applications of Wireless Multimedia Sensor Networks (WMSNs), which is more vulnerable to security attacks due to the presence of multimedia data. Additionally, given the limited technological resources (in term of energy, computation, bandwidth, and storage) of sensor nodes, security and privacy policies have to be combined with energy-aware algorithms and distributed processing of multimedia contents in WMSNs. To solve these problems in this paper, an energy efficient distributed steganography scheme, which combines steganography technique with the concept of distributed computing, is proposed for secure communication in WMSNs. The simulation results show that the proposed method can achieve considerable energy efficiency while assuring the communication security simultaneously.     

The Impact of Deployment Pattern and Routing Scheme on the Lifetime in Multi-Sink Wireless Sensor Network

Extensive use of sensor and actuator networks in many real-life applications introduced several new performance metrics at the node and network level. Since wireless sensor nodes have significant battery constraints, therefore, energy efficiency, as well as network lifetime, are among the most significant performance metrics to measure the effectiveness of given network architecture. This work investigates the performance of an event-based data delivery model using a multipath routing scheme for a wireless sensor network with multiple sink nodes. This routing algorithm follows a sink initiated route discovery process with the location information of the source nodes already known to the sink nodes. It also considers communication link costs before making decisions for packet forwarding. Carried out simulation compares the network performance of a wireless sensor network with a single sink, dual sink, and multi sink networking approaches. Based on a series of simulation experiments, the lifetime aware multipath routing approach is found appropriate for increasing the lifetime of sensor nodes significantly when compared to other similar routing schemes. However, energy-efficient packet forwarding is a major concern of this work; other network performance metrics like delay, average packet latency, and packet delivery ratio are also taken into the account.

     

Optimal load balanced clustering in homogeneous wireless sensor networks

Balancing the load among sensor nodes is a major challenge for the long run operation of wireless sensor networks. When a sensor node becomes overloaded, the likelihood of higher latency, energy loss, and congestion becomes high. In this paper, we propose an optimal load balanced clustering for hierarchical cluster‐based wireless sensor networks. We formulate the network design problem as mixed‐integer linear programming. Our contribution is 3‐fold: First, we propose an energy aware cluster head selection model for optimal cluster head selection. Then we propose a delay and energy‐aware routing model for optimal inter‐cluster communication. Finally, we propose an equal traffic for energy efficient clustering for optimal load balanced clustering. We consider the worst case scenario, where all nodes have the same capability and where there are no ways to use mobile sinks or add some powerful nodes as gateways. Thus, our models perform load balancing and maximize network lifetime with no need for special node capabilities such as mobility or heterogeneity or pre‐deployment, which would greatly simplify the problem. We show that the proposed models not only increase network lifetime but also minimize latency between sensor nodes. Numerical results show that energy consumption can be effectively balanced among sensor nodes, and stability period can be greatly extended using our models.     

Routing Protocol for Heterogeneous Hierarchical Wireless Multimedia Sensor Networks

Recently, wireless multimedia sensor networks (WMSNs) have emerged as one of the most important technologies, driven by the development of powerful multimedia device such as CMOS. WMSNs require several factors such as resource constraints, specific QoS, high bandwidth and so on. In this paper, we propose a hierarchical heterogeneous network model based routing protocol for WMSNs. In our proposal, proposed network model is classified into monitoring class, delivery class and aggregation class. Also we define two kinds of the routing path in order to ensure bandwidth and QoS. In simulation results, we illustrate the performance of our proposal.     

TPGF: geographic routing in wireless multimedia sensor networks

In this paper, we propose an efficient Two-Phase geographic Greedy Forwarding (TPGF) routing algorithm for WMSNs. TPGF takes into account both the requirements of real time multimedia transmission and the realistic characteristics of WMSNs. It finds one shortest (near-shortest) path per execution and can be executed repeatedly to find more on-demand shortest (near-shortest) node-disjoint routing paths. TPGF supports three features: (1) hole-bypassing, (2) the shortest path transmission, and (3) multipath transmission, at the same time. TPGF is a pure geographic greedy forwarding routing algorithm, which does not include the face routing, e.g., right/left hand rules, and does not use planarization algorithms, e.g., GG or RNG. This point allows more links to be available for TPGF to explore more routing paths, and enables TPGF to be different from many existing geographic routing algorithms. Both theoretical analysis and simulation comparison in this paper indicate that TPGF is highly suitable for multimedia transmission in WMSNs.     

Energy‐aware geographic routing in wireless sensor networks with anchor nodes

Energy efficiency has become an important design consideration in geographic routing protocols for wireless sensor networks because the sensor nodes are energy constrained and battery recharging is usually not feasible. However, numerous existing energy‐aware geographic routing protocols are energy‐inefficient when the detouring mode is involved in the routing. Furthermore, most of them rarely or at most implicitly take into account the energy efficiency in the advance. In this paper, we present a novel energy‐aware geographic routing (EAGR) protocol that attempts to minimize the energy consumption for end‐to‐end data delivery. EAGR adaptively uses an existing geographic routing protocol to find an anchor list based on the projection distance of nodes for guiding packet forwarding. Each node holding the message utilizes geographic information, the characteristics of energy consumption, and the metric of advanced energy cost to make forwarding decisions, and dynamically adjusts its transmission power to just reach the selected node. Simulation results demonstrate that our scheme exhibits higher energy efficiency, smaller end‐to‐end delay, and better packet delivery ratio compared to other geographic routing protocols. Copyright © 2011 John Wiley & Sons, Ltd.     

LRP: Link quality‐aware queue‐based spectral clustering routing protocol for underwater acoustic sensor networks

Recently, underwater acoustic sensor networks (UASNs) have been considered as a promising approach for monitoring and exploring the oceans in lieu of traditional underwater wireline instruments. As a result, a broad range of applications exists ranging from oil industry to aquaculture and includes oceanographic data collection, disaster prevention, offshore exploration, assisted navigation, tactical surveillance, and pollution monitoring. However, the unique characteristics of underwater acoustic communication channels, such as high bit error rate, limited bandwidth, and variable delay, lead to a large number of packet drops, low throughput, and significant waste of energy because of packets retransmission in these applications. Hence, designing an efficient and reliable data communication protocol between sensor nodes and the sink is crucial for successful data transmission in underwater applications. Accordingly, this paper is intended to introduce a novel nature‐inspired evolutionary link quality‐aware queue‐based spectral clustering routing protocol for UASN‐based underwater applications. Because of its distributed nature, link quality‐aware queue‐based spectral clustering routing protocol successfully distributes network data traffic load evenly in harsh underwater environments and avoids hotspot problems that occur near the sink. In addition, because of its double check mechanism for signal to noise ratio and Euclidean distance, it adopts opportunistically and provides reliable dynamic cluster‐based routing architecture in the entire network. To sum up, the proposed approach successfully finds the best forwarding relay node for data transmission and avoids path loops and packet losses in both sparse and densely deployed UASNs. Our experimental results obtained in a set of extensive simulation studies verify that the proposed protocol performs better than the existing routing protocols in terms of data delivery ratio, overall network throughput, end‐to‐end delay, and energy efficiency.     

无线多媒体传感器网络路由协议研究

传统的无线传感器网络(Wireless Sensor Networks,WSNs)路由协议不能很好地适应多媒体数据流的传输.近来,提出了一些无线多媒体传感器网络(Wireless Multimedia Sensor Networks,WMSNs)路由协议.本文首先讲述了WMSNs服务质量保障路由问题及其面临的挑战,从五...     

Cooperative Caching in Wireless Multimedia Sensor Networks

The recent advances in miniaturization and the creation of low-power circuits, combined with small-sized batteries have made the development of wireless sensor networks a working reality. Lately, the production of cheap complementary metal-oxide semiconductor cameras and microphones, which are able to capture rich multimedia content, gave birth to what is called Wireless Multimedia Sensor Networks (WMSNs). WMSNs will boost the capabilities of current wireless sensor networks, and will fuel several novel applications, like multimedia surveillance sensor networks. WMSNs introduce several new research challenges, mainly related to mechanisms to deliver application-level Quality-of-Service (e.g., latency minimization). To address this goal in an environment with extreme resource constraints, with variable channel capacity and with requirements for multimedia in-network processing, the caching of multimedia data, exploiting the cooperation among sensor nodes is vital. This article presents a cooperative caching solution particularly suitable for WMSNs. The proposed caching solution exploits sensor nodes which reside in “positions” of the network that allow them to forward packets or communicate decisions within short latency. These so-called “mediator” nodes are selected dynamically, so as to avoid the creation of hot-spots in the communication and the depletion of their energy. The mediators are not more powerful than the rest of the nodes, but they have some special role in implementing the cooperation among the sensors. The proposed cooperative caching protocol includes components for locating cached data as well as for implementing data purging out of the sensor caches. The proposed solution is evaluated extensively in an advanced simulation environment, and it is compared to the state-of-the-art cooperative caching algorithm for mobile ad hoc networks. The results confirm that the proposed caching mechanism prevails over its competitor.     

Pruned discrete Tchebichef transform for image coding in wireless multimedia sensor networks

After the successful development of the discrete cosine transform (DCT) especially in audio, image and video coding, many state-of-the-arts DCT-based fast algorithms have been developed. However, these algorithms are floating-point and are implemented with high algorithmic complexity and memory intensive. Therefore, they consume large system resources. In particular, those requirements pose a serious limitation on multimedia applications in resource-constrained systems, such as wireless multimedia sensor networks (WMSNs). In this paper we investigate an alternative to DCT transform which known as discrete Tchebichef transform (DTT). Despite its good energy compaction property, low algorithmic complexity and low memory requirements, the DTT is potentially unexploited in the literature. To further reduce its complexity and memory requirements, in this paper we propose a pruned version of DTT (P-DTT). Simulation results show that P-DTT requires a reduced number of arithmetic operations, energy consumption and memory. And it has at the same time competitive compression efficiency compared with Loeffler-DCT and exact DTT. The proposed P-DTT transform is a viable option for image compression and/or communication over WMSNs.