142 research outputs found
Analysis of the Tradeoff Between Network Lifetime and k-connectivity in WSNs
No full text26th Telecommunications Forum (TELFOR) -- NOV 20-21, 2018 -- Belgrade, SERBIAReliability and network lifetime maximization are two important objectives when designing a Wireless Sensor Network (WSN). However, these two are conflicting objectives. To increase the reliability maintaining k-connectivity is necessary, yet, for higher k values transmission power should be kept at the maximum which reduces the lifetime. In this study we investigate the reliability versus lifetime tradeoff.Telecommunicat Soc, Univ Belgrade, Sch Elect Engn, IEEE Serbia & Montenegro COM Chapter, Telekom Serbija a d, Minist Trade Tousim & Telecommunicat, VLATACOM d o o, ERICSSON, IRITEL a d BEOGRAD, MAKSNET Telekomunikacije, Minist Educ Sci & Technol Dev, MDS, Publ PTT Enterprise Srbija, Republ Agcy Elect Communicat Serbia, ROAMING Networks, TERI Engn, VIP Mobile, CISCO, IEEE Serbia & Montenegro Sect, KAPSCH, Serbian Natl Register of Internet Domain Names, IEEE Commun Soc Serbia & Montenegro Chapter, IEEE Reg 8, mtsTUBITAKTurkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) [113E470]Orhan Dagdeviren and Vahid Khalilpour Akram thank to TUBITAK for grant number 113E470
Modelling Contiki-Based IoT Systems
No full textIn this paper, we investigate how model-driven engineering (MDE) of Internet of Things (IoT) systems and Wireless-Sensor Networks (WSN) can be supported and introduce a domain-specific metamodel for modeling such systems based on the well-known Contiki operating system. The unique lightweight thread structure of Contiki makes it more preferable in the implementation of new IoT systems instead of many other existing platforms. Although some MDE approaches exist for IoT systems and WSNs, currently there is no study which addresses the modelling according to the specifications of Contiki platform. The work presented in this paper aims at filling this gap and covers the development of both a modeling language syntax and a graphical modeling environment for the MDE of IoTs according to event-driven mechanism and protothread architecture of Contiki. Use of the proposed modeling language is demonstrated with including the development of an IoT system for forest fire detection
A survey of agent technologies for wireless sensor networks
No full textWireless sensor networks (WSNs) do not have a fixed infrastructure and consist of sensor nodes that perform sensing and communicating tasks. The WSNs have large application spectrum such as habitat monitoring, military surveillance, and target tracking, where sensor nodes may operate distributed in highly dynamic environments. Battery-constrained sensor nodes may aggregate the sensed data, localize themselves, and route the packets in an energy-efficient and decentralized manner to enable running the applications. Agents are capable of independent and autonomous action, so that they can successfully carry out tasks that have been delegated to them, thus agent-based approaches are very suitable to apply as the solution of the problems occurring in WSNs. So far many agent-based approaches were proposed for WSNs. This paper surveys the agent technologies for sensor networks by providing a classification, objectives and costs of these approaches with the open research problems. To the best of our knowledge, this is the first study that covers the intersection of the agent technology and sensor networks from a wide perspective
Enhancing Drone Network Resilience: Investigating Strategies Fori> K/I>-connectivity Restoration
No full textDrones have recently become more popular due to technological improvements that have made them useful in many other industries, including agriculture, emergency services, and military operations. Coordination of communication amongst drones is often required for the efficient performance of missions. With an emphasis on building robust k-connected networks and restoration procedures, this paper investigates the relevance of connection in drone swarms. Specifically, we tackle the k-connectivity restoration problem, which aims to create k-connected networks by moving the drones as little as possible. We propose four novel approaches, including an integer programming model, an integer programming-based heuristic approach, a node converging heuristic, and a cluster moving heuristic. Through extensive measurements taken from various drone networking setups, we provide a comparative analysis of the proposed approaches. Our evaluations reveal that the drone movements produced by the integer programming-based heuristics are nearly the same as the original mathematical formulation, whereas the other heuristics are favorable in terms of execution time.Mustafa Asci, Vahid Khalilpour Akram, Orhan Dagdeviren and Bulent Tavli express their gratitude to The Scientific and Technological Research Council of Turkey (TUBITAK) for providing grant no 121E500.Scientific and Technological Research Council of Turkey (TUBITAK) [121E500
A Hierarchical Leader Election Protocol for Mobile Ad Hoc Networks
No full text8th International Conference on Computational Science -- JUN 23-25, 2008 -- Cracow, POLANDLeader Election is an important problem in mobile ad hoc networks and in distributed computing systems. In this study, we propose a hierarchical, cluster based protocol to elect a leader in a mobile ad hoc network. The initial phase of the protocol employs a clustering algorithm to group nodes of the network after which a leader for a cluster(clusterhead) is elected. The second phase is performed by forming a connected ring of these leaders using the Ring Formation Algorithm. Finally, Chang Roberts Leader Election Algorithm for rings is employed in the final phase to elect the super-leader among the clusterheads. We provide performance results of this protocol for various mobility parameters and analyze its time and message complexities.Hewlett Packard Co, Intel Corp, Qumak Sekom AM & IBM, Microsoft Corp, ATM SA, Elsevier, Springe
A Distributed Backbone Formation Algorithm for Mobile Ad Hoc Networks
No full text4th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2006; Sorrento; Italy; 4 December 2006 through 6 December 2006Construction of a backbone architecture is an important issue in mobile ad hoc networks(MANET)s to ease routing and resource management. We propose a new fully distributed algorithm for backbone formation in MANETs that constructs a directed ring architecture. We show the operation of the algorithm, analyze its message complexity and provide results in the simulation environment of ns2. Our results conform that the algorithm is scalable in terms of its running time and roundtrip delay against mobility, surface area, number of nodes and number of clusterheads
Performance evaluation of cluster-based target tracking protocols for wireless sensor networks
No full text24th International Symposium on Computer and Information Sciences -- SEP 14-16, 2009 -- Guzelyurt, CYPRUSTarget tracking is an important application type for wireless sensor networks (WSN). Recently, various approaches [1-11] are proposed to maintain the accurate tracking of the targets as well as low energy consumption. Clustering is a fundamental technique to manage the scarce network resources [12-19]. The message complexity of an application can be significantly decreased when it is redesigned on top of a clustered network. Clustering has provided an efficient infrastructure in many existing studies [1-8]. The clusters can be constructed before the target enters the region which is called the static method [1-4] or clusters are created by using received signal strength (RSS) from target which is called the dynamic method [5-8]. In this paper we provide simulations of static and dynamic clustering algorithms against various mobility models and target speeds. The mobility models that we applied are Random Waypoint Model, Random Direct Model and Gauss Markov Model. We provide metrics to measure the tracking performance of both approaches. We show that the dynamic clustering is favorable in terms of tracking accuracy whereas the energy consumption of static clustering is significantly smaller. We also show that the target moving with Gauss Markov Model can be tracked more accurately than the other models.Middle E Tech Uni
Modelling contiki-based IoT systems
No full text6th Symposium on Languages, Applications and Technologies, SLATE 2017 -- 26 June 2017 through 27 June 2017 -- 131023In this paper, we investigate how model-driven engineering (MDE) of Internet of Things (IoT) systems and Wireless-Sensor Networks (WSN) can be supported and introduce a domain-specific metamodel for modeling such systems based on the well-known Contiki operating system. The unique lightweight thread structure of Contiki makes it more preferable in the implementation of new IoT systems instead of many other existing platforms. Although some MDE approaches exist for IoT systems and WSNs, currently there is no study which addresses the modelling according to the specifications of Contiki platform. The work presented in this paper aims at filling this gap and covers the development of both a modeling language syntax and a graphical modeling environment for the MDE of IoTs according to event-driven mechanism and protothread architecture of Contiki. Use of the proposed modeling language is demonstrated with including the development of an IoT system for forest fire detection. © Caglar Durmaz, Moharram Challenger, Orhan Dagdeviren, and Geylani Kardas115E449 Türkiye Bilimsel ve Teknolojik Araştirma Kurumu, TÜBITAK* Authors would like to thank the Scientific and Technological Research Council of Turkey (TUBITAK) Electric, Electronic and Informatics Research Group (EEEAG) for covering SLATE conference attendance and paper presentation expenses under the project grant 115E449. -
A Software Architecture for Shared Resource Management in Mobile Ad hoc Networks
No full textAbstract. We provide the implementation results of the distributed mutual exclusion algorithm based on Ricart-Agrawala algorithm for mobile ad hoc networks (MANETs) using the ns2 simulator described in [2]. The MANET consists of a ring of clusters and it is partitioned into a number of clusters periodically using the MCA [11]. Each cluster is represented by a coordinator. We also show a new algorithm to construct a directed ring architecture across coordinators to be able to implement the distributed mutual exclusion algorithm. Coordinators implement various distributed mutual exclusion algorithms on behalf of any member in the cluster they represent. We show experimentally that the protocol designed is scalable and that it provides an order of decrease in message and time complexities when compared with other algorithms.
Distributed Algorithms to Form Cluster Based Spanning Trees in Wireless Sensor Networks
No full textAbstract. We propose two algorithms to form spanning trees in sen-sor networks. The first algorithm forms hierarchical clusters of spanning trees with a given root, the sink. All of the nodes in the sensor network are then classified iteratively as subroot, intermediate or leaf nodes. At the end of this phase, the local spanning trees are formed, each having a unique subroot (clusterhead) node. The communication and data ag-gregation towards the sink by an ordinary node then is accomplished by sending data to the local subroot which routes data towards the sink. A modified version of the first algorithm is also provided which ensures that the obtained tree is a breadth-first search tree where a node can modify its parent to yield shorter distances to the root. Once the sub-spanning trees in the clusters are formed, a communication architecture such as a ring can be formed among the subroots. This hybrid architec-ture which provides co-existing spanning trees within clusters yields the necessary foundation for a two-level communication protocol in a sensor network as well as providing a structure for a higher level abstraction such as the γ synchronizer where communication between the clusters is performed using the ring similar to an α synchronizer and the intra cluster communication is accomplished using the sub-spanning trees as in the β synchronizers. We discuss the model along with the algorithms, compare them and comment on their performances. Key words: spanning tree, clustering, synchronizers, wireless sensor networks
- …
