7,195 Hits in 3.6 sec

Directional Virtual Coordinate Systems for Wireless Sensor Networks

Dulanjalie C. Dhanapala, Anura P. Jayasumana
2011 2011 IEEE International Conference on Communications (ICC)  
With these directional properties, it is possible, for the first time, to consider deterministic algorithms in the virtual domain, as illustrated with a constrained tree network example.  ...  A VCS characterizes each node in a network with the minimum hop distances to a set of anchor nodes as its coordinates.  ...  Properties in the new directional VCS and deterministic routing in a constrained tree network 3.  ... 
doi:10.1109/icc.2011.5963079 dblp:conf/icc/DhanapalaJ11 fatcat:6uqyjsgv4zbe3i4ax5w7edlb2u

A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks

Dalila B. M. M. Fontes, José Fernando Gonçalves
2012 Optimization Letters  
This problem is an extension of the well know NP-hard hop-constrained Minimum Spanning Tree problem (HMST) and we have termed it hop-constrained minimum cost flow spanning tree problem (HMFST).  ...  Genetic algorithms and other evolutionary algorithms have been successfully applied to solve constrained minimum spanning tree problems in a variety of communication network design problems.  ...  The problem can be equivalently casted as finding a hop-constrained tree solution on minimum cost flow networks with nonlinear costs.  ... 
doi:10.1007/s11590-012-0505-5 fatcat:wckrr7wvpvf7plpx56riqqgbnq

Toward monetary cost effective content placement in cloud centric media network

Yichao Jin, Yonggang Wen, Kyle Guan, Daniel Kilper, Haiyong Xie
2013 2013 IEEE International Conference on Multimedia and Expo (ICME)  
First, for a single content, we map it into a k-center problem, and find a logarithmic relationship between the mean hop distance from users to contents, and the reciprocal of replica number.  ...  Our objective is to minimize the monetary cost incurred by using cloud resources to orchestrate an elastic and global content delivery network (CDN) service.  ...  Backbone Network 1 10 1 10 Popularity Index of Content Number of Replica Constrained by 150 MB/s Unconstrained Constrained by 1.35 GB (b) NSF Network 1 10 1 10 1 10 1 10  ... 
doi:10.1109/icme.2013.6607582 dblp:conf/icmcs/JinWGKX13 fatcat:m3d2jikvwzhmhdroogwbkrwx6i

Deadlock-Free Fully Adaptive Routing in Irregular Networks without Virtual Channels

Dong Xiang, Zhigang Yu, Jie Wu
2013 2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications  
This paper proposes a new flow control scheme in VCT-switched irregular networks. Based on the new scheme, a novel deadlock-free fully adaptive routing algorithm is introduced.  ...  The proposed fully adaptive routing algorithm is on the basis of different baseline routing schemes: up*/down*, and multiple spanning tree based routing schemes.  ...  turn in spanning tree with root 1 : the spanning tree with root 1 : constrained turn in spanning tree with root 8 : the spanning tree with root 8 cycle, is reduced by the size of the cycle.  ... 
doi:10.1109/trustcom.2013.120 dblp:conf/trustcom/XiangY013 fatcat:uqpurgghozdthhci4suqpkw5qm

A Reconfigurable Formation and Disjoint Hierarchical Routing for Rechargeable Bluetooth Networks

Chih-Min Yu, Yi-Hsiu Lee
2016 Energies  
As a result, the reconfigurable mesh-tree constructs a mesh-shaped topology in one densely covered area that is extended by tree-shaped topology to other sparsely covered areas.  ...  Each new root asks its upstream master to start a return connection to convert the first tree-shaped subnet into a mesh-shaped subnet.  ...  In addition, a peak-search method is introduced and simulated to determine the optimum mesh-tree configuration for both ad hoc and sensor networks scenario.  ... 
doi:10.3390/en9050338 fatcat:trd6nesvbne3bezxsgue37vjhm

ACOM: Any-source Capacity-constrained Overlay Multicast in Non-DHT P2P Networks

Shiping Chen, Baile Shi, Shigang Chen
2007 IEEE Transactions on Parallel and Distributed Systems  
The distributed execution of the algorithms naturally defines an implicit, roughly-balanced, capacity-constrained multicast tree for each source node.  ...  No explicit multicast trees are maintained on top of the overlay.  ...  Overlay Multicast Network Infrastructure (OMNI) [12] dynamically adapts its degree-constrained multicast tree to minimize the latencies to the entire client set.  ... 
doi:10.1109/tpds.2007.1037 fatcat:mamq2vajrnbx3b2ozkzhle7isy

Review on Clustering and Data Aggregation in Wireless Sensor Network

Pooja Mann, Tarun Kumar
2014 International Journal of Computer Applications Technology and Research  
Wireless Sensor Network is a collection of various sensor nodes with sensing and communication capabilities.  ...  The main goal of Data Aggregation is to collect and aggregate the data by maintaining the energy efficiency so that the network lifetime can be increased.  ...  Tree based Data Aggregation In a tree based network, sensor nodes are organized into a tree where data aggregation is performed at intermediate nodes along the tree and a concise representation of the  ... 
doi:10.7753/ijcatr0307.1004 fatcat:uzzg4fordfaabljtktutxtdyoi

Exploring the Tradeoff between Performance and Overhead of the Relay Selection Mechanism in the Uniform Stress Routing Protocol

Nawel Alioua, Haruo Takeda
2018 Proceedings of the Asian Internet Engineering Conference on - AINTEC '18  
The constrained nature of Low power and Lossy Networks (LLNs) inevitably impacts fundamental networking tasks.  ...  In a previous work, we briefly introduced the Uniform Stress Routing protocol (USR), an approach inspired from the load distribution in trees.  ...  In such constrained networking settings, it is interesting to turn for inspiration to the oldest and most constrained environment we know: nature.  ... 
doi:10.1145/3289166.3289168 dblp:conf/aintec/AliouaT18 fatcat:l5mord7labcmnjmldfahvvqh5m

On the topology of multicast trees

R.C. Chalmers, K.C. Almeroth
2003 IEEE/ACM Transactions on Networking  
The benefit derived from using multicast is seemingly dependent upon the shape of the distribution tree. In this paper, we attempt to accurately model interdomain multicast trees.  ...  We find that interdomain multicast trees actually do share a common shape at both the router and autonomous system levels.  ...  Although theoretically a multicast tree could take on any shape, in real networks, a tree's shape is constrained by the underlying network connectivity.  ... 
doi:10.1109/tnet.2002.804835 fatcat:os57ewgcd5g5jja3n323sbt5r4

QoS Aware and Survivable Network Design for Planned Wireless Sensor Networks [article]

Abhijit Bhattacharya, Anurag Kumar
2014 arXiv   pre-print
Next, we study the problem of survivable network design with guaranteed QoS, i.e, the requirement is to have at least k > 1 node disjoint hop constrained paths from each source to the BS.  ...  First we sudy the problem of guaranteed QoS connected network design, where the objective is to have at least one path from each source to the BS with the specified hop count bound.  ...  We studied both one connected hop constrained network design, and k-connected (survivable) hop constrained network design.  ... 
arXiv:1110.4746v5 fatcat:52ed2tqe5ze6je5o3zgxw25db4

Building a case for FIPA Compliant Multiagent Approaches for Wireless Sensor Networks

Khalid Nawaz, Alejandro P. Buchmann
2008 Proceedings of the First International Conference on Ambient Media and Systems  
There have been some efforts to apply agent based approaches in Wireless Sensor Networks (WSNs) for different application scenarios in recent past.  ...  In Figure 5 , we plot average number of messages transferred per node versus the size of the grid-shaped network in terms of number of square shaped layers (n).  ...  Total number of hops that agent travels in order to cover the network of Figure 4 .  ... 
doi:10.4108/icst.ambisys2008.2906 dblp:conf/ambisys/NawazB08 fatcat:vm5l6bekd5dlxcusj5ese7i2ie

Multicast Routing Protocol with Group-Level Congestion Prediction and Permanence under Constrained Energy Utilization for Mobile Ad Hoc Networks

K Himabindu
2012 IOSR Journal of Computer Engineering  
Packet loss in network routing is principally because of link failure and congestion.  ...  A multicast topology for ad hoc wireless networks (AMRIS) [4] builds a common distributed tree fixed at one of the nodes, with IDs rising as they give off from the starting node.  ...  hop level node: Unlike traditional networks, nodes within the ad hoc set-up exhibit a higher degree of non uniformity in terms of each hardware and package configurations.  ... 
doi:10.9790/0661-0634251 fatcat:foafgozpurhljdqjxersek4664

Toward Cost-Efficient Content Placement in Media Cloud: Modeling and Analysis

Yichao Jin, Yonggang Wen, Kyle Guan
2016 IEEE transactions on multimedia  
Cloud-centric media network (CCMN) was previously proposed to provide cost-effective content distribution services for user-generated contents (UGCs) based on media cloud.  ...  Specifically, it is formulated into a constrained optimization problem, in which the objective is to minimize the total monetary cost, with respect to the resource capacity.  ...  S2 Sub-tree S3 (b) Optimal Partition when n=3 Sub-tree S1 Sub-tree S2 Sub-tree S3 where n i=0 |S i | = N , and S i ∩ S j = ∅ for i = j, so that the aggregated hop distance, from the roots to all other  ... 
doi:10.1109/tmm.2016.2537199 fatcat:xrls25aqjbhcvlc6m4gugwkmzu

Beware of the hidden! How cross-traffic affects quality assurances of competing real-time Ethernet standards for in-car communication

Till Steinbach, Hyung-Taek Lim, Franz Korf, Thomas C. Schmidt, Daniel Herrscher, Adam Wolisz
2015 2015 IEEE 40th Conference on Local Computer Networks (LCN)  
By comparing the real-time approaches Ethernet AVBs asynchronous credit based shaping with the time-triggered and rate-constrained traffic classes of Time-triggered Ethernet (AS6802) we quantify how different  ...  jitter can become 14 times higher than for a network without background tasks.  ...  The topology forms a tree structure with a maximum of 4 hops (see Fig. 4 ) between each sender and receiver.  ... 
doi:10.1109/lcn.2015.7366277 dblp:conf/lcn/SteinbachLKSHW15 fatcat:nt7ort3bfbf7ldkpcdknhrdfay

Dynamic and Real-time Sleep Schedule Protocols for Energy Efficiency in WSNs

Kaebeh Yaeghoobi S.B., M.K. Soni, S.S. Tyagi
2016 International Journal of Computer Network and Information Security  
Another issue is jitter (packet delay variation), which accumulate due to multi-hop network.  ...  The design principles of the propose methods are (1) achieving predictable timing through shaping traffic inside the network, and (2) take advantage of applicationordinate to forms transmission timing.  ...  The DSDR adjusts network transmission based on maximum multi-hop delay.  ... 
doi:10.5815/ijcnis.2016.01.02 fatcat:5gvlqdvtwfcuvg775xmok2ehtm
« Previous Showing results 1 — 15 out of 7,195 results