First ICFITT 2017: Future Internet Tech & Trends Conference Proceedings

需积分: 9 40 浏览量更新于2024-07-19 收藏 56.01MB PDF 举报

"《Future Internet Technologies and Trends》是第一国际会议的论文集，无水印的英文原版PDF，可以在多种PDF阅读器上正常打开。这本书的内容可能涵盖未来互联网技术与趋势的最新研究和发展，源自网络，如果存在侵权问题，可以联系相关人员删除。在亚马逊美国官网上可以获取更多关于本书的详细信息。" 本书《Future Internet Technologies and Trends》由Zuber Patel和Shilpi Gupta编辑，是2017年8月31日至9月2日在印度苏拉特举行的First International Conference, ICFITT 2017的会议论文集，收录了220篇来自全球各地学者的研究成果。这个会议聚焦于未来互联网技术与趋势，展示了当前科研领域的前沿动态。该系列的论文集属于Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering的一部分，这是一个汇集计算机科学、社会信息学和电信工程领域最新研究成果的重要出版物。编委会由一众知名学者组成，包括来自土耳其中东技术大学的Ozgur Akan，意大利博洛尼亚大学的Paolo Bellavista，香港理工大学的Jiannong Cao等，他们在各自的专业领域有着深厚的研究背景和影响力。这表明了会议和论文集的权威性和专业性。会议涵盖的主题可能包括但不限于：网络架构的创新，如软件定义网络（SDN）和网络功能虚拟化（NFV），物联网（IoT）的发展，大数据分析在互联网中的应用，云计算技术，网络安全与隐私保护，移动计算和通信，以及新兴的5G通信技术等。这些议题反映了未来互联网技术的多元化和集成化发展趋势，对于理解并预测互联网技术的未来走向具有重要意义。通过参与这样的国际会议和阅读相关的论文，读者可以了解到全球范围内对未来互联网的研究热点和挑战，以及最新的理论和技术进展。这些知识对于研究人员、工程师、政策制定者以及对互联网技术感兴趣的任何人都具有极高的参考价值。同时，能够在亚马逊美国官网获取更多详细信息，意味着读者可以进一步深入探索这些领域的深度研究和讨论。

LOGO Algorithm 5

Fig. 1. A linear network with 100 sensor nodes.

Fig. 2. A random network with 100 sensor nodes.

3 The Local Minima Finding Algorithm

A local minimum node, also called Local Leader, is the node which has no neigh-

bor with a value smaller than its own value. But this value is not necessarily

a global minimum. The marked nodes, represented by the red arrows in Fig. 4,

show examples of local minima.

The Local Minima Finding (LMF) Algorithm uses the same principle as

the previously presented MinFind algorithm to determine if a node is a local

minimum or not, with the exception that each node will send its co ordinates

only once, and after receiving the messages from all its neighbors, it decides if it

is a local minimum or not in case it receives a smaller value than its own. The

algorithm of ﬁnding local minima is given as follows:

Algorithm 2. LMF : The pseudo-code of the Local Minima Finding Algorithm

Input: t, v

Output: local

min

1: local

min = true;

2: x

min

= v;

3: send(x

min

,*);

4: while (((x =read(t))= nul l)andlocal

min) do

5: if (x<x

min

) then

6: lo cal

min = false;

7: end if

8: end while

LOGO Algorithm 9

Table 2. Functions of the proposed algorithms.

Function Deﬁnition

getId() returns the node identiﬁer

delay(dt) waits dt milliseconds b efore going to the next instruction

add(v,t) adds the value v at the top of the vector t

pop(t) removes the value at the top of the vector t and returns it

stop() stops the execution of the program

send(a,b) sends the message a to the sensor node having the identiﬁer b,

or in a broadcast (if b = ∗)

read() waiting for receipt of messages. This function is blocking, which

means that if there is no received message any more, it remains

blo cked in this instruction

read(wt) waiting for receipt of messages. If there is no received message

after wt milliseconds then the execution will continue and go to

the next instruction

local minima. This time must be changed if the number of neighbors of a sensor

node is very important. It is the time required for any sensor node to send a

message in a broadcast and receive mode from its neighbor nodes. Then it sends

a message T2 to ask the local minima to send their value x (lines 5 and 6). In line

8, the reference node will wait for receiving a message containing the id of the

transmitter (r

id), the value r x of the local minimum message and t, the stack

of the path from the local minimum node to the reference node. If a message

is received before wt milliseconds, then it means that a message T3 is received

from a local minimum node. In this case, the received value r

x is tested whether

it is smaller than the current value x

min which at the beginning is equal to the

local value x (line 18). If this is the case, the reference node will be declared as

a non-global minimum (line 19), the value of id

min will be updated with the

value of r

id (line 20), the value of x min will be updated with the value of r x

(line 21) and the route t from the reference node to the local minimum (id

min)

will be assigned to t min (line 22). Otherwise, if the received message is null

(line 9), which can happen when the node does not receive any message during

the wt milliseconds, then the reference node has received messages from all the

local minima. In this case, if the global

min value is equal to true, the reference

node is the global minimum and the algorithm will stop (line 15). Otherwise, the

route t is the one situated between the reference node and the global minimum

node. A message T4 will be sent to the global minimum, having the identiﬁer

min, using the route t (lines 11 to 13) in order to elect it.

Algorithm 4 of the remaining node takes as input only the value x.The

output global

min is a variable which is equal to true if the current node is a

leader (global minimum) and false, otherwise. Each non-reference node starts

with initializations (lines 1 to 5). The variable once1 is used to allow only once

剩余284页未读，继续阅读

yinkaisheng-nj

粉丝: 763
资源: 6231

First ICFITT 2017: Future Internet Tech & Trends Conference Proc...

最新资源

First ICFITT 2017: Future Internet Tech & Trends Conference Proc...

"ICCSE 2021：IEEE第六届国际计算机科学会议

"移动通信发展历程与趋势：从1G到5G，全面分析与展望

"全球小麦市场形势及展望：中国农业展望大会定量经济分析

Future Internet Technologies and Trends First International Conference epub

Content-Based Image Retrieval Ideas, Influences, and Current Trends 无水印原版pdf

Springer.Future.Internet.Technologies.and.Trends.First.International.Conference

Flex and Flex-Rigid PCB Technologies and Trends.pdf

Semantic Web Technologies - Trends and Research in Ontology-based Systems(2006).pdf

Scene text detection and recognition_ recent advances and future trends.pdf

2022 - Spinal endoscopy evidence, techniques, global trends, and future projections.pdf

最新资源