51,566 research outputs found
Optimizing Wirelessly Powered Crowd Sensing: Trading energy for data
To overcome the limited coverage in traditional wireless sensor networks,
\emph{mobile crowd sensing} (MCS) has emerged as a new sensing paradigm. To
achieve longer battery lives of user devices and incentive human involvement,
this paper presents a novel approach that seamlessly integrates MCS with
wireless power transfer, called \emph{wirelessly powered crowd sensing} (WPCS),
for supporting crowd sensing with energy consumption and offering rewards as
incentives. The optimization problem is formulated to simultaneously maximize
the data utility and minimize the energy consumption for service operator, by
jointly controlling wireless-power allocation at the \emph{access point} (AP)
as well as sensing-data size, compression ratio, and sensor-transmission
duration at \emph{mobile sensor} (MS). Given the fixed compression ratios, the
optimal power allocation policy is shown to have a \emph{threshold}-based
structure with respect to a defined \emph{crowd-sensing priority} function for
each MS. Given fixed sensing-data utilities, the compression policy achieves
the optimal compression ratio. Extensive simulations are also presented to
verify the efficiency of the contributed mechanisms.Comment: arXiv admin note: text overlap with arXiv:1711.0206
Socio-economic aware data forwarding in mobile sensing networks and systems
The vision for smart sustainable cities is one whereby urban sensing is core to optimising city
operation which in turn improves citizen contentment. Wireless Sensor Networks are envisioned
to become pervasive form of data collection and analysis for smart cities but deployment of
millions of inter-connected sensors in a city can be cost-prohibitive. Given the ubiquity and
ever-increasing capabilities of sensor-rich mobile devices, Wireless Sensor Networks with Mobile
Phones (WSN-MP) provide a highly flexible and ready-made wireless infrastructure for future
smart cities. In a WSN-MP, mobile phones not only generate the sensing data but also relay the
data using cellular communication or short range opportunistic communication. The largest
challenge here is the efficient transmission of potentially huge volumes of sensor data over
sometimes meagre or faulty communications networks in a cost-effective way.
This thesis investigates distributed data forwarding schemes in three types of WSN-MP: WSN
with mobile sinks (WSN-MS), WSN with mobile relays (WSN-HR) and Mobile Phone Sensing
Systems (MPSS). For these dynamic WSN-MP, realistic models are established and distributed
algorithms are developed for efficient network performance including data routing and forwarding,
sensing rate control and and pricing. This thesis also considered realistic urban sensing
issues such as economic incentivisation and demonstrates how social network and mobility
awareness improves data transmission. Through simulations and real testbed experiments, it
is shown that proposed algorithms perform better than state-of-the-art schemes.Open Acces
Mobile Wireless Sensor Networks: An Overview
Mobile wireless sensor networks (MWSNs) have emerged and shifted the focus from the typical static wireless sensor networks to networks with mobile sensor nodes that are capable to sense the various types of events. Also, they can change their position frequently in a specific sensing area. The applications of the MWSNs can be widely divided into time-driven, event-driven, on-demand and tracking based applications. Mobile sensor node architecture, residual energy utilization, mobility, topology, scalability, localization, data collection routing, Quality of Service (QoS), etc., are the key factors to design an energy efficient MWSNs for some specific purpose. This chapter deals with an overview of the MWSNs and a few significant phenomena to design an energy efficient MWSNs to the large-scale environment
MOBILE NETWORKING FOR âSMART DUSTâ WITH RFID SENSOR NETWORKS
Large-scale networks of wireless sensors are becoming an active topic of research.. We review the key elements of the emergent technology of âSmart Dustâ and outline the research challenges they present to the mobile networking and systems community, which must provide coherent connectivity to large numbers of mobile network nodes co-located within a small volume. Smart Dust sensor networks â consisting of cubic millimetre scale sensor nodes capable of limited computation, sensing, and passive optical communication with a base station â are envisioned to fulfil complex large scale monitoring tasks in a wide variety of application areas. RFID technology can realize âsmart-dustâ applications for the sensor network community. RFID sensor networks (RSNs), which consist of RFID readers and RFID sensor nodes (WISPs), extend RFID to include sensing and bring the advantages of small, inexpensive and long-lived RFID tags to wireless sensor networks. In many potential Smart Dust applications such as object detection and tracking, fine-grained node localization plays a key role
Security and Privacy in Heterogeneous Wireless and Mobile Networks: Challenges and Solutions
abstract: The rapid advances in wireless communications and networking have given rise to a number of emerging heterogeneous wireless and mobile networks along with novel networking paradigms, including wireless sensor networks, mobile crowdsourcing, and mobile social networking. While offering promising solutions to a wide range of new applications, their widespread adoption and large-scale deployment are often hindered by people's concerns about the security, user privacy, or both. In this dissertation, we aim to address a number of challenging security and privacy issues in heterogeneous wireless and mobile networks in an attempt to foster their widespread adoption. Our contributions are mainly fivefold. First, we introduce a novel secure and loss-resilient code dissemination scheme for wireless sensor networks deployed in hostile and harsh environments. Second, we devise a novel scheme to enable mobile users to detect any inauthentic or unsound location-based top-k query result returned by an untrusted location-based service providers. Third, we develop a novel verifiable privacy-preserving aggregation scheme for people-centric mobile sensing systems. Fourth, we present a suite of privacy-preserving profile matching protocols for proximity-based mobile social networking, which can support a wide range of matching metrics with different privacy levels. Last, we present a secure combination scheme for crowdsourcing-based cooperative spectrum sensing systems that can enable robust primary user detection even when malicious cognitive radio users constitute the majority.Dissertation/ThesisPh.D. Electrical Engineering 201
Energy Efficient Routing Algorithm in Wireless Sensor Networks
This Wireless sensor network (WSN) is widely considered as one of the most important technologies for the twenty-first century, it provides the availability of small and low-cost sensor nodes with the ability of sensing different types of physical and environmental conditions, data processing, and wireless communication. Sensor nodes have a limited transmission range, and their processing and storage capabilities as well as their energy resources are also limited. Thus, optimized routing algorithms for wireless sensor networks should be utilized in order to maintain the routes in the network and to ensure reliable multi-hop communication under these conditions. Keywords: Wireless Sensor Networks, Energy Efficiency, Routing Protocols, Solar Sensors, Mobile Agent
Data Aggregation Based Proactive Data Reporting Protocol for Wireless Sensor Network
Wireless sensor networks are the grouping of tiny sensor nodes that gathers the information by sensing activeness from the surroundings similar lands, forests, hills, sea. Power saving is a critical issue in wireless sensor networks since sensor nodes are battery-powered. To achieve optimized network performance at collecting a small portion of sensed data in network is in current researches. There are many protocols available for the successful communication. Sink trail and sink trail-s are the two energy efficient proactive data reporting protocols for mobile sink based on data collection with low complexity and reduced control overhead. In wireless sensor networks, using mobile sinks mobility rather than static sink for data collection is the new trend. Recently the researches are giving the concentration on moving patterns of the mobile sink to achieve optimized network performance, collecting a small area of sensed data in the network and also reducing energy consumption is main motto of the recent searches. Sink trail and sink trail-S protocols aim to conserve energy by turning off unnecessary sensors while simultaneously preserving a constant level of routing fidelity. In the proposed system we proposed the system that provides solution over mobility problems in wireless sensor network with energy saving methodology using aggregation technique.
DOI: 10.17762/ijritcc2321-8169.150616
Coverage Protocols for Wireless Sensor Networks: Review and Future Directions
The coverage problem in wireless sensor networks (WSNs) can be generally
defined as a measure of how effectively a network field is monitored by its
sensor nodes. This problem has attracted a lot of interest over the years and
as a result, many coverage protocols were proposed. In this survey, we first
propose a taxonomy for classifying coverage protocols in WSNs. Then, we
classify the coverage protocols into three categories (i.e. coverage aware
deployment protocols, sleep scheduling protocols for flat networks, and
cluster-based sleep scheduling protocols) based on the network stage where the
coverage is optimized. For each category, relevant protocols are thoroughly
reviewed and classified based on the adopted coverage techniques. Finally, we
discuss open issues (and recommend future directions to resolve them)
associated with the design of realistic coverage protocols. Issues such as
realistic sensing models, realistic energy consumption models, realistic
connectivity models and sensor localization are covered
Robotic Wireless Sensor Networks
In this chapter, we present a literature survey of an emerging, cutting-edge,
and multi-disciplinary field of research at the intersection of Robotics and
Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor
Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system
that aims to achieve certain sensing goals while meeting and maintaining
certain communication performance requirements, through cooperative control,
learning and adaptation. While both of the component areas, i.e., Robotics and
WSN, are very well-known and well-explored, there exist a whole set of new
opportunities and research directions at the intersection of these two fields
which are relatively or even completely unexplored. One such example would be
the use of a set of robotic routers to set up a temporary communication path
between a sender and a receiver that uses the controlled mobility to the
advantage of packet routing. We find that there exist only a limited number of
articles to be directly categorized as RWSN related works whereas there exist a
range of articles in the robotics and the WSN literature that are also relevant
to this new field of research. To connect the dots, we first identify the core
problems and research trends related to RWSN such as connectivity,
localization, routing, and robust flow of information. Next, we classify the
existing research on RWSN as well as the relevant state-of-the-arts from
robotics and WSN community according to the problems and trends identified in
the first step. Lastly, we analyze what is missing in the existing literature,
and identify topics that require more research attention in the future
Optimal coverage multi-path scheduling scheme with multiple mobile sinks for WSNs
Wireless Sensor Networks (WSNs) are usually formed with many tiny sensors which are randomly deployed within sensing field for target monitoring. These sensors can transmit their monitored data to the sink in a multi-hop communication manner. However, the âhot spotsâ problem will be caused since nodes near sink will consume more energy during forwarding. Recently, mobile sink based technology provides an alternative solution for the long-distance communication and sensor nodes only need to use single hop communication to the mobile sink during data transmission. Even though it is difficult to consider many network metrics such as sensor position, residual energy and coverage rate etc., it is still very important to schedule a reasonable moving trajectory for the mobile sink. In this paper, a novel trajectory scheduling method based on coverage rate for multiple mobile sinks (TSCR-M) is presented especially for large-scale WSNs. An improved particle swarm optimization (PSO) combined with mutation operator is introduced to search the parking positions with optimal coverage rate. Then the genetic algorithm (GA) is adopted to schedule the moving trajectory for multiple mobile sinks. Extensive simulations are performed to validate the performance of our proposed method
- âŠ