Sciweavers

4189 search results - page 771 / 838
» On the Security of Wireless Sensor Networks
Sort
View
JPDC
2006
134views more  JPDC 2006»
13 years 10 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
ITNG
2010
IEEE
14 years 3 months ago
D-SeDGAM: A Dynamic Service Differentiation Based GTS Allocation Mechanism for IEEE 802.15.4 WSN
—The plethora of applications for Wireless Sensor Networks (WSN) has experienced significant growth in recent years. Every application has a different set of requirements and it ...
Berta Carballido Villaverde, Susan Rea, Dirk Pesch
ICC
2007
IEEE
124views Communications» more  ICC 2007»
14 years 4 months ago
Emulating End-to-End Losses and Delays for Ad Hoc Networks
— Ad hoc networks have gained place in the research area recently. There are many researches regarding different topics related to such networks, such as routing, media access co...
Alaa Seddik-Ghaleb, Yacine Ghamri-Doudane, Sidi-Mo...
DATE
2009
IEEE
229views Hardware» more  DATE 2009»
14 years 5 months ago
Health-care electronics The market, the challenges, the progress
— Exploding health care demands and costs of aging and stressed populations necessitate the use of more in-home monitoring and personalized health care. Electronics hold great pr...
Wolfgang Eberle, Ashwin S. Mecheri, Thi Kim Thoa N...
CCS
2009
ACM
14 years 5 months ago
On non-cooperative location privacy: a game-theoretic analysis
In mobile networks, authentication is a required primitive of the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudo...
Julien Freudiger, Mohammad Hossein Manshaei, Jean-...