The ability of active networks technology to allow customized router computation critically depends on having resource control techniques that prevent buggy, malicious, or greedy code from affecting the integrity or availability of node resources. It is hard to choose between static and dynamic checking for resource control. Dynamic checking has the advantage of basing its decisions on precise ...

Geographic routing is an attractive routing strategy in wireless sensor networks. It works well in dense networks, but it may suffer from the void problem. For this purpose, a recovery step is required to guarantee packet delivery. Face routing has widely been used as a recovery strategy since proved to guarantee delivery. However, it relies on a planar graph not always achievable in realistic ...

This paper considers state estimation of linear systems using analog amplify and forwarding with multiple sensors, for both multiple access and orthogonal access schemes. Optimal state estimation can be achieved at the fusion center using a time varying Kalman filter. We show that in many situations, the estimation error covariance decays at a rate of 1/M when the number of sensors M is large. ...

wireless sensor network includes a large number of nodes which are distributed in a geographical location. the essential fact about wsn is that energy of nodes is limited. therefore, presenting proper solutions as an optimized routing is crucial to equally use energy of all nodes. in this paper we propose a method which performs routing in wsns using greedy approach. it is able to choose optimu...

The algorithmic small-world phenomenon, empirically established by Milgram’s letter forwarding experiments from the 60s [59], was theoretically explained by Kleinberg in 2000 [46]. However, from today’s perspective his model has several severe shortcomings that limit the applicability to real-world networks. In order to give a more convincing explanation of the algorithmic small-world phenomeno...

We introduce and study the notion of weak semi-greedy systems—which is inspired in concepts branch systems thresholding sets-, prove that infinite dimensional Banach spaces, notions semi-greedy, almost greedy Markushevich bases are all equivalent. This completes extends some results from (Berná J Math Anal Appl 470:218–225, 2019; Dilworth et al. Studia 159:67–101, 2003; Funct 263:3900–3921, 201...