Toggle navigation
Home
People
Projects
Documents
Products
Courses
Login
Editing document
Tryear
Trmonth
Trnumber
Title
Abstract
Wireless networks have historically considered support for mobile elements as an extra overhead. However, recent research has provided means by which network can take advantage of mobile elements. Particularly, in the case of wireless sensor networks, mobile elements are deliberately built into the system to improve the lifetime of the network, and act as mechanical carriers of data. The mobile element, which is controlled, visits the nodes to collect their data before their buffers are full. It may happen that the sensor nodes are sampling at different rates, in which case some nodes need to be visited more frequently than others. We present this problem of scheduling the mobile element in the network, so that there is no data loss due to buffer overflow. We prove that the problem is NP-Complete and give an ILP formulation. We give some practical algorithms, and compare their performances.
Filename
File
Urlpdfpaper
Urlsrcpaper
Urlpdfpresentation
Urlsrcpresentation
Urlavmedia
Urldoi
Urlpublisher
Urlgooglescholar
Urlciteseer
Pubin
Pubvol
Pubnum
Pubnum end
Pubpagefirst
Pubpagelast
Pubpagecount
Pubdate
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
January
February
March
April
May
June
July
August
September
October
November
December
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
Pubdate end
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
January
February
March
April
May
June
July
August
September
October
November
December
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
Pubplace
Publisher
Ispublic
Islabdocument
Miscattributes
Document category
Main research area
Show
|
Back