Energy Efficiency in Cooperative Wireless Sensor Networks

[EN] The transport of sensitive products is very important because their deterioration may cause the value lost and even the product rejection by the buyer. In addition, it is important to choose the optimal way to achieve this end. In a data network, the task of calculating the best routes is performed by routers. We can consider the optimal path as the one that provides a shortest route. However, if a real transport network is considered the shortest path can sometimes be affected by incidents and traffic jams that would make it inadvisable. On the other hand, when we need to come back, due to features that symmetry provides, it would be interesting to follow the same path in reverse sense. For this reason, in this paper we present a symmetric routing mechanism for cooperative monitoring system for the delivery of fresh products. The systems is based on a combination of fixed nodes and a mobile node that stores the path followed to be able of coming back following the same route in reverse sense. If this path is no longer available, the system will try to maintain the symmetry principle searching the route that provide the shortest time to the used in the initial trip. The paper shows the algorithm used by the systems to calculate the symmetric routes. Finally, the system is tested in a real scenario which combines different kind of roads. As the results shows, the energy consumption of this kind of nodes is highly influenced by the activity of sensors.This work has been supported by the "Ministerio de Economia y Competitividad", through the "Convocatoria 2014. Proyectos I+D -Programa Estatal de Investigacion Cientifica y Tecnica de Excelencia" in the "Subprograma Estatal de Generacion de Conocimiento", (project TIN2014-57991-C3-1- P) and the "programa para la Formacion de Personal Investigador - (FPI-2015-S2-884)" by the "Universitat Politecnica de Valencia".Sendra, S.; Lloret, J.; Lacuesta, R.; Jimenez, JM. (2019). Energy Efficiency in Cooperative Wireless Sensor Networks. Mobile Networks and Applications. 24(2):678-687. https://doi.org/10.1007/s11036-016-0788-3S678687242Derks HG, Buehler WS, Hall MB (2013) Real-time method and system for locating a mobile object or person in a tracking environment. US Patent 8514071 B2. Aug 20, 2013Witmond R, Dutta R, Charroppin P (2006) Method for tracking a mail piece. US Patent 7003376 B2, Feb 21, 2006Lu L, Liu Y, Han J (2015) ACTION: breaking the privacy barrier for RFID systems. Ad Hoc and Sensor Wireless Networks 24(1–2):135–159Dhakal S, Shin S (2013) Precise time system efficiency of a frame slotted aloha based anti-collision algorithm in a RFID system. Network Protocols and Algorithms 5(2):16–27. doi: 10.5296/npa.v5i2.3373Ghafoor KZ, Bakar KA, Lloret J, Khokhar RH, Lee KC (2013) Intelligent beaconless geographical forwarding for urban vehicular environments. Wirel Netw 19(3):345–362. doi: 10.1007/s11276-012-0470-zWeinsberg U, Shavitt Y, Schwartz Y (2009) Stability and symmetry of internet routing. In proc of the 2009 I.E. INFOCOM Workshops 2009, April 19–25, Rio de Janeiro, Brazil, p 1–2 doi: 10.1109/INFCOMW.2009.5072192Garcia M, Bri D, Sendra S, Lloret J (2010) Practical deployments of wireless sensor networks: a survey. Int Journal on Advances in Networks and Services 3(1&2):163–178Bri D, Garcia M, Lloret J, Dini P (2009) Real deployments of wireless sensor networks. in Proc of the third International Conference on Sensor Technologies and Applications (SENSORCOMM’09), June 18–23. Athens (Greece), p 415–423 doi: 10.1109/SENSORCOMM.2009.69Karim L, Anpalagan A, Nasser N, Almhana J (2013) Sensor-based M2 M agriculture monitor-ing Systems for Developing Countries: state and challenges. Network Protocols and Algorithms 5(3):68–86. doi: 10.5296/npa.v5i3.3787Garcia M, Lloret J, Sendra S, Rodrigues JJPC (2011) Taking cooperative decisions in group-based wireless sensor networks. Lect Notes Comput Sci 6874:61–65. doi: 10.1007/978-3-642-23734-8_9Garcia M, Sendra S, Lloret J, Lacuesta R (2010) Saving energy with cooperative group-based wireless sensor networks. Lect Notes Comput Sci 6240:231–238. doi: 10.1007/978-3-642-16066-0_11Silva FN, Comin CH, Peron TKDM, Rodrigues FA, Ye C, Wilson RC, Hancock ER, Costa LF (2016) Concentric network symmetry. Inf Sci 333:61–80. doi: 10.1016/j.ins.2015.11.014Jedermann R, Schouten R, Sklorz A, Lang W, Van Kooten O (2006) Linking keeping quality models and sensor systems to an autonomous transport supervision system. In proc of the 2nd Int Workshop Cold Chain Management, May 8–9, Bonn, Germany, p 3–18Li J, Cao J (2015) Survey of object tracking in wireless sensor networks. Ad Hoc and Sensor Wireless Networks 25(1–2):89–120Shamsuzzoha A, Addo-Tenkorang R, Phuong D, Helo P. (2011). Logistics tracking: An implementation issue for delivery network. In proc of the PICMET’11: Conference Technology Management in the Energy Smart World, July 31–August 4, Portland, (Oregon-USA) p 1–10Torres RV, Sanchez JC, Galan LM (2014) Unmarked point and adjacency vertex, mobility models for the generation of emergency and rescue scenarios in urban areas. Ad Hoc and Sensor Wireless Networks 23(3–4):211–233Paxson V (1997) Measurements and Analysis of End-to-End Internet Dynamics. (Ph.D. Thesis). University of California, Berkeley. April, 1997. Available at: ftp://ftp.ee.lbl.gov/papers/vp-thesis/ Last access: 18 Oct 2016Codish M, Frank M, Itzhakov A, Miller A. (2014). Solving Graph Coloring Problems with Abstraction and Symmetry. AarXiv preprint arXiv:1409.5189. Available at: http://arxiv.org/abs/1409.5189 Last access: 18 Oct 2016Chambers D, Flapan E (2014) Topological symmetry groups of small complete graphs. Symmetry 6(2):189–209. doi: 10.3390/sym6020189Gong Y, Zhang W, Zhang Z, Li Y (2016) Research and implementation of traffic sign recognition system. Wireless Communications, Networking and Applications 348:553–560. doi: 10.1007/978-81-322-2580-5_50Waspmote features (2016) In Digi Web Site. Available at: http://www.digi.com/products/wireless-wired-embedded-solutions/zigbee-rf-modules/point-multipoint-rfmodules/xbee-series1-module#specs , Last access: 18 Oct 2016Wang Z, Lu M, Yuan X, Zhang J, Van De Wetering H (2013) Visual traffic jam analysis based on trajectory data. IEEE Trans Vis Comput Graph 19(12):2159–2168. doi: 10.1109/TVCG.2013.228Meghanathan N, Mumford P (2013) Centralized and distributed algorithms for stability-based data gathering in mobile sensor networks. Network Protocols and Algorithms 5(4):84–116. doi: 10.5296/npa.v5i4.4208Alrajeh NA, Khan S, Lloret J, Loo J (2014) Artificial neural network based detection of energy exhaustion attacks in wireless sensor networks capable of energy harvesting. Ad Hoc & Sensor Wireless Networks 22(3–4):109–133Garcia M, Sendra S, Lloret J, Canovas A (2013) Saving energy and improving communications using cooperative group-based wireless sensor networks. Telecommun Syst 52(4):2489–2502. doi: 10.1007/s11235-011-9568-

About the Capacity of Flat and Self-Organized Ad Hoc and Hybrid Networks

Ad hoc networking specific challenges foster a strong research effort on efficient protocols design. Routing protocols based on a self-organized structure have been studied principally for the robustness and the scalability they provide. On the other hand, self-organization schemes may decrease the network capacity since they concentrate the traffic on privileged links. This paper presents four models for evaluating the capacity of a routing schemes on 802.11 like networks. Our approach consists in modeling the radio resource sharing principles of 802.11 like MAC protocols as a set of linear constraints. We have implemented two models of fairness. The first one assumes that nodes have a fair access to the channel, while the second one assumes that on the radio links. We then develop a pessimistic and an optimistic scenarii of spatial re-utilization of the medium, yielding a lower bound and an upper bound on the network capacity for each fairness case. Our models are independent of the routing protocols and provide therefore a relevant framework for their comparison. We apply our models to a comparative analysis of the well-known shortest path base flat routing protocol OLSR against two main self-organized structure approaches, VSR, and Wu & Li's protocols. This study concludes on the relevance of self-organized approaches from the network capacity point of view

A network access control framework for 6LoWPAN networks

Low power over wireless personal area networks (LoWPAN), in particular wireless sensor networks, represent an emerging technology with high potential to be employed in critical situations like security surveillance, battlefields, smart-grids, and in e-health applications. The support of security services in LoWPAN is considered a challenge. First, this type of networks is usually deployed in unattended environments, making them vulnerable to security attacks. Second, the constraints inherent to LoWPAN, such as scarce resources and limited battery capacity, impose a careful planning on how and where the security services should be deployed. Besides protecting the network from some well-known threats, it is important that security mechanisms be able to withstand attacks that have not been identified before. One way of reaching this goal is to control, at the network access level, which nodes can be attached to the network and to enforce their security compliance. This paper presents a network access security framework that can be used to control the nodes that have access to the network, based on administrative approval, and to enforce security compliance to the authorized nodes

Dynamic auto configuration and self-management of next generation personal area networks

Estágio realizado no INESC-Porto e orientado pelo Eng.º Rui Lopes CamposTese de mestrado integrado. Engenharia Electrotécnica e de Computadores. Faculdade de Engenharia. Universidade do Porto. 200

Dynamic wireless mobile framework for distributed collaborative real-time information generation and control systems

Intelligent Transportation Systems (ITS) have only recently discovered the exciting possibilities in the nomadic and ubiquitous computing space to build a new generation of information systems by allowing the vehicle to act both as a carrier and consumer of wireless (and thus omnipresent) information. Wide deployment of such ITS systems may eventually allow for more dynamic and efficient transportation systems, which can contribute in several ways towards greater economic growth whilst respecting environmental sustainability. A great number of researchers have dedicated considerable time and resources to tackling traffic related issues by utilising the new wireless capabilities enabled by ITS; such initiatives cover a wide range of applications such as safety, knowledge sharing and infotainment. Indicative of the extent of such efforts is the plethora of research projects initiated by many national and multi-national organisations such as the EU Framework Programme for Research and Technological Development. To achieve their goals, proposed solutions from such organisations depend on the development and deployment of intelligent wireless mobile communication systems, where data dissemination issues make the prospect of efficient and effective communication a challenging proposition. Presently, Car-to-Car and Car-to-Infrastructure communications are two distinct avenues that make possible efficient and reliable delivery of messages via direct radio links in traffic areas. In all cases, high quality of communication performance is desirable for a communication system composed mostly of roaming participants; such a system needs to be dynamic, flexible and infrastructure-less. Consequently, Mobile Ad hoc Network (MANET)-based networks are a natural fit to ITS

A Framework for the Capacity Evaluation of Multihop Wireless Networks

Accepted for publications : march 19th 2009. OPTx-editorial-board=yes, OPTx-proceedings=yes, OPTx-international-audience=yesInternational audienceThe specific challenges of multihop wireles networks lead to a strong research effort on efficient protocols design where the offered capacity is a key objective. More specifically, routing strategy largely impacts the network capacity, i.e. the throughput offered to each flow. In this work, we propose a complete framework to compute the upper and the lower bounds of the network capacity according to a physical topology and a given routing protocol. The radio resource sharing principles of CSMA-CA is modeled as a set of linear constraints with two models of fairness. The first one assumes that nodes have a fair access to the channel, while the second one assumes that on the radio links. We then develop a pessimistic and an optimistic scenarios for radio resource sharing, yielding a lower bound and an upper bound on the network capacity for each fairness case. Our approach is independent of the network topology and the routing protocols, and provides therefore a relevant framework for their comparison. We apply our models to a comparative analysis of a well-known flat routing protocol OLSR against two main self-organized structure approaches, VSR and localized CDS

Capacity Evaluation Framework and Validation of Self-Organized Routing Schemes

International audienceAssuming a given network topology and a routing protocol, this work is focused on the capacity evaluation of routing protocols based on either a self-organization scheme or a flat approach. To reach this goal, we propose to use linear-programming formulation to model radio resource sharing as linear constraints. Four models are detailed to evaluate the capacity of any routing scheme in wireless multihops networks. First, two models of fairness are proposed: either each node has a fair access to the channel, or the fairness is among the radio links. Besides, a pessimistic and an optimistic scenarios of spatial re-utilization of the medium are proposed, yielding a lower bound and an upper bound on the network capacity for each fairness case. Finally, using this model, we provide a comparative analysis of some flat and self-organized routing protocol

A self-organization structure for Hybrid Networks

International audienceThis paper focuses on the self-organization of ad hoc and hybrid networks. We propose to organize networks with two integrated virtual structures: a backbone and clusters. The backbone helps to optimize the flooding of control packets, and to offer a natural prolongation of the backbone of wired networks. Clusters help to hierarchize the network, each of which is managed logically by its clusterhead. Since MANETs are mobile, we propose distributed algorithms for both the construction and the maintenance to preserve an efficient virtual structure despite topology changes. Simulations results exhibit the robustness and persistence of the proposed virtual structure